Block #337,047

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/31/2013, 9:44:18 AM · Difficulty 10.1389 · 6,480,200 confirmations

2CC
Cunningham Chain of the Second Kind

A sequence where each prime is double the previous prime minus one.

Block Header
Block Hash
0e04b09edca77726f7af4a31e5c8133f871c9eec6393aed81be06470c0c9a6f4

Height

#337,047

Difficulty

10.138912

Transactions

19

Size

9.67 KB

Version

2

Bits

0a238fc2

Nonce

230,538

Timestamp

12/31/2013, 9:44:18 AM

Confirmations

6,480,200

Merkle Root

466489dd14984cb3535428778d2fdde3342006e0ee43c30788d2e678a6dfbae3
Prime Chain Origin

This is the prime chain origin stored in the block header. It is a composite number (not prime itself) — it equals the first prime in the chain multiplied by a primorial. The origin anchors the entire chain to this specific block.

7.259 × 10¹⁰²(103-digit number)
72599347338439968412…41791287198282748001
Discovered Prime Numbers
p_k = 2^k × origin + 1

These are the actual prime numbers discovered by this block, computed using the verified Primecoin formula. Each number has been independently confirmed to pass the Fermat primality test. Use the FactorDB links to verify any number independently.

1
origin + 1
7.259 × 10¹⁰²(103-digit number)
72599347338439968412…41791287198282748001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.451 × 10¹⁰³(104-digit number)
14519869467687993682…83582574396565496001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.903 × 10¹⁰³(104-digit number)
29039738935375987364…67165148793130992001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.807 × 10¹⁰³(104-digit number)
58079477870751974729…34330297586261984001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.161 × 10¹⁰⁴(105-digit number)
11615895574150394945…68660595172523968001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.323 × 10¹⁰⁴(105-digit number)
23231791148300789891…37321190345047936001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.646 × 10¹⁰⁴(105-digit number)
46463582296601579783…74642380690095872001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.292 × 10¹⁰⁴(105-digit number)
92927164593203159567…49284761380191744001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.858 × 10¹⁰⁵(106-digit number)
18585432918640631913…98569522760383488001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.717 × 10¹⁰⁵(106-digit number)
37170865837281263827…97139045520766976001
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 consecutive prime numbers forming a Cunningham Chain of the Second Kind. The prime chain origin — the large number shown above — anchors the chain and is divisible by a primorial (the product of small primes), cryptographically tying these prime numbers to this specific block.

★★☆☆☆
Rarity
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

How Primecoin's Proof-of-Work Constructs These Primes

Primecoin stores a value called the prime chain origin in each block. The miner found a large integer such that when divided by a primorial (the product of small primes: 2 × 3 × 5 × 7 × …), the result is the first prime in the chain. The origin is deliberately divisible by this primorial — that divisibility is part of the proof.

Prime Chain Origin = First Prime × Primorial (2·3·5·7·11·…)
Source: Primecoin prime.cpp — CheckPrimeProofOfWork()

This is why the origin has many small prime factors — those factors are the primorial divisor. The chain then extends from the first prime using the 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,782,009 XPM·at block #6,817,246 · updates every 60s
xpmprime.info is a work in progress. If you enjoy using this service you can support this project with a Primecoin donation.
Privacy Policy·

Cookie Preferences

We use cookies to enhance your experience. Some are essential for the site to function, while others help us understand how you use the site.

·Privacy Policy