Block #309,511

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/13/2013, 3:42:49 PM · Difficulty 9.9948 · 6,507,210 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
77bccb4ca0f8b4462bb13575699f83aeed6ba8fe2e7f71c4bee19f4469b296bb

Height

#309,511

Difficulty

9.994843

Transactions

15

Size

4.12 KB

Version

2

Bits

09feae01

Nonce

114,337

Timestamp

12/13/2013, 3:42:49 PM

Confirmations

6,507,210

Merkle Root

99225c17e061dc52f2c2c13e4a4f9404af783d9c0d056e7c88cfc93e16ccf4e2
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.

7.736 × 10⁹³(94-digit number)
77363042719266577821…93424369400960837121
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
7.736 × 10⁹³(94-digit number)
77363042719266577821…93424369400960837121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.547 × 10⁹⁴(95-digit number)
15472608543853315564…86848738801921674241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.094 × 10⁹⁴(95-digit number)
30945217087706631128…73697477603843348481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.189 × 10⁹⁴(95-digit number)
61890434175413262256…47394955207686696961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.237 × 10⁹⁵(96-digit number)
12378086835082652451…94789910415373393921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.475 × 10⁹⁵(96-digit number)
24756173670165304902…89579820830746787841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.951 × 10⁹⁵(96-digit number)
49512347340330609805…79159641661493575681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.902 × 10⁹⁵(96-digit number)
99024694680661219610…58319283322987151361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.980 × 10⁹⁶(97-digit number)
19804938936132243922…16638566645974302721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.960 × 10⁹⁶(97-digit number)
39609877872264487844…33277133291948605441
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,777,801 XPM·at block #6,816,720 · 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