Block #605,437

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/28/2014, 12:36:00 PM · Difficulty 10.9099 · 6,208,643 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e9aa01c0e768319fd2dd393956a843ce317f48b578cbb3d29da7051796e4f30d

Height

#605,437

Difficulty

10.909860

Transactions

4

Size

1.89 KB

Version

2

Bits

0ae8ec9e

Nonce

81,976

Timestamp

6/28/2014, 12:36:00 PM

Confirmations

6,208,643

Merkle Root

74f1863fec9a9043aab7cb3e2c9e0f3b44bcb7ab8b42f42646996999d5020d3b
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.

2.964 × 10⁹²(93-digit number)
29640542864892626723…94215749158864475761
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
2.964 × 10⁹²(93-digit number)
29640542864892626723…94215749158864475761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.928 × 10⁹²(93-digit number)
59281085729785253447…88431498317728951521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.185 × 10⁹³(94-digit number)
11856217145957050689…76862996635457903041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.371 × 10⁹³(94-digit number)
23712434291914101378…53725993270915806081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.742 × 10⁹³(94-digit number)
47424868583828202757…07451986541831612161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.484 × 10⁹³(94-digit number)
94849737167656405515…14903973083663224321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.896 × 10⁹⁴(95-digit number)
18969947433531281103…29807946167326448641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.793 × 10⁹⁴(95-digit number)
37939894867062562206…59615892334652897281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.587 × 10⁹⁴(95-digit number)
75879789734125124412…19231784669305794561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.517 × 10⁹⁵(96-digit number)
15175957946825024882…38463569338611589121
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,756,720 XPM·at block #6,814,079 · 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