Block #468,855

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/31/2014, 7:16:30 PM · Difficulty 10.4325 · 6,348,067 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2f5abcf901a4a6fdf68df8e26b1c07f8fb94cb0ad64ee512cea9a055bd43b42f

Height

#468,855

Difficulty

10.432521

Transactions

2

Size

1.66 KB

Version

2

Bits

0a6eb9b0

Nonce

59,072

Timestamp

3/31/2014, 7:16:30 PM

Confirmations

6,348,067

Merkle Root

8e45c07d5a85e5f8dd8427743ea756b0ac3b08a16c9fbc6398e7b37aebac4978
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.

1.435 × 10¹¹¹(112-digit number)
14350262382442878040…71477145367216128001
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
1.435 × 10¹¹¹(112-digit number)
14350262382442878040…71477145367216128001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.870 × 10¹¹¹(112-digit number)
28700524764885756081…42954290734432256001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.740 × 10¹¹¹(112-digit number)
57401049529771512162…85908581468864512001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.148 × 10¹¹²(113-digit number)
11480209905954302432…71817162937729024001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.296 × 10¹¹²(113-digit number)
22960419811908604865…43634325875458048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.592 × 10¹¹²(113-digit number)
45920839623817209730…87268651750916096001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.184 × 10¹¹²(113-digit number)
91841679247634419460…74537303501832192001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.836 × 10¹¹³(114-digit number)
18368335849526883892…49074607003664384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.673 × 10¹¹³(114-digit number)
36736671699053767784…98149214007328768001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.347 × 10¹¹³(114-digit number)
73473343398107535568…96298428014657536001
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,779,416 XPM·at block #6,816,921 · 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