Block #432,796

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/7/2014, 4:09:25 AM · Difficulty 10.3392 · 6,385,208 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
72e722b80125c7c344904aff30a642edf8b4e8726e46e869b2b984092d4c9e89

Height

#432,796

Difficulty

10.339224

Transactions

3

Size

4.25 KB

Version

2

Bits

0a56d75d

Nonce

35,302,588

Timestamp

3/7/2014, 4:09:25 AM

Confirmations

6,385,208

Merkle Root

6a51cc967f48675c1388e26b4b3d2715f92c5a6d6c7d772f7bccb3e089c17014
Transactions (3)
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.

8.037 × 10⁹⁴(95-digit number)
80372197617843937742…72850198679956217681
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
8.037 × 10⁹⁴(95-digit number)
80372197617843937742…72850198679956217681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.607 × 10⁹⁵(96-digit number)
16074439523568787548…45700397359912435361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.214 × 10⁹⁵(96-digit number)
32148879047137575097…91400794719824870721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.429 × 10⁹⁵(96-digit number)
64297758094275150194…82801589439649741441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.285 × 10⁹⁶(97-digit number)
12859551618855030038…65603178879299482881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.571 × 10⁹⁶(97-digit number)
25719103237710060077…31206357758598965761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.143 × 10⁹⁶(97-digit number)
51438206475420120155…62412715517197931521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.028 × 10⁹⁷(98-digit number)
10287641295084024031…24825431034395863041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.057 × 10⁹⁷(98-digit number)
20575282590168048062…49650862068791726081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.115 × 10⁹⁷(98-digit number)
41150565180336096124…99301724137583452161
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,788,097 XPM·at block #6,818,003 · 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