Block #72,745

2CCLength 9★☆☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/21/2013, 1:57:18 AM · Difficulty 8.9943 · 6,723,318 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4c3632f2a03f08646f4a05491743a654ac880799c89005da4358ec8a773f94f8

Height

#72,745

Difficulty

8.994306

Transactions

4

Size

1018 B

Version

2

Bits

08fe8add

Nonce

10

Timestamp

7/21/2013, 1:57:18 AM

Confirmations

6,723,318

Merkle Root

cec9ec012c265373820edb947d744adc99c163970969a390585086f75f6365f5
Transactions (4)
1 in → 1 out12.3700 XPM110 B
4 in → 1 out49.3900 XPM497 B
1 in → 1 out12.3500 XPM157 B
1 in → 1 out12.3400 XPM158 B
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.

9.484 × 10¹⁰⁸(109-digit number)
94849746761922051992…06011398948873464061
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
9.484 × 10¹⁰⁸(109-digit number)
94849746761922051992…06011398948873464061
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.896 × 10¹⁰⁹(110-digit number)
18969949352384410398…12022797897746928121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.793 × 10¹⁰⁹(110-digit number)
37939898704768820797…24045595795493856241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.587 × 10¹⁰⁹(110-digit number)
75879797409537641594…48091191590987712481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.517 × 10¹¹⁰(111-digit number)
15175959481907528318…96182383181975424961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.035 × 10¹¹⁰(111-digit number)
30351918963815056637…92364766363950849921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.070 × 10¹¹⁰(111-digit number)
60703837927630113275…84729532727901699841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.214 × 10¹¹¹(112-digit number)
12140767585526022655…69459065455803399681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.428 × 10¹¹¹(112-digit number)
24281535171052045310…38918130911606799361
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 9 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
CommonChain length 9

Found in most blocks. The baseline for Primecoin's proof-of-work.

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,612,598 XPM·at block #6,796,062 · 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.