Block #642,560

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/21/2014, 7:20:46 PM · Difficulty 10.9569 · 6,148,384 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8f1d859548e29ff87c60c2e3ccb37becf5cfe8d4893e6171d9c04f232d405984

Height

#642,560

Difficulty

10.956949

Transactions

6

Size

13.59 KB

Version

2

Bits

0af4fa9f

Nonce

1,537,691,461

Timestamp

7/21/2014, 7:20:46 PM

Confirmations

6,148,384

Merkle Root

dc241fde6e943113c55aa2948c4beb83ff2529494e6963c19c88aa0411506a16
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.

4.547 × 10⁹⁴(95-digit number)
45479733816001382614…06476436735020700801
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
4.547 × 10⁹⁴(95-digit number)
45479733816001382614…06476436735020700801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.095 × 10⁹⁴(95-digit number)
90959467632002765229…12952873470041401601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.819 × 10⁹⁵(96-digit number)
18191893526400553045…25905746940082803201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.638 × 10⁹⁵(96-digit number)
36383787052801106091…51811493880165606401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.276 × 10⁹⁵(96-digit number)
72767574105602212183…03622987760331212801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.455 × 10⁹⁶(97-digit number)
14553514821120442436…07245975520662425601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.910 × 10⁹⁶(97-digit number)
29107029642240884873…14491951041324851201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.821 × 10⁹⁶(97-digit number)
58214059284481769747…28983902082649702401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.164 × 10⁹⁷(98-digit number)
11642811856896353949…57967804165299404801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.328 × 10⁹⁷(98-digit number)
23285623713792707898…15935608330598809601
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,571,562 XPM·at block #6,790,943 · updates every 60s