Block #309,203

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/13/2013, 11:53:43 AM · Difficulty 9.9948 · 6,498,139 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7f83b6b848ce15bec94425b4a700cbb1aa710b495f172d9ae9e79075e0c50dea

Height

#309,203

Difficulty

9.994753

Transactions

14

Size

3.08 KB

Version

2

Bits

09fea822

Nonce

182,269

Timestamp

12/13/2013, 11:53:43 AM

Confirmations

6,498,139

Merkle Root

f698b5cb2c067a9a55ae585ce825ff2588506e105ff6af7420008283ba2640be
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.774 × 10⁹⁴(95-digit number)
17746520854419091833…85317700285085216001
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.774 × 10⁹⁴(95-digit number)
17746520854419091833…85317700285085216001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.549 × 10⁹⁴(95-digit number)
35493041708838183667…70635400570170432001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.098 × 10⁹⁴(95-digit number)
70986083417676367334…41270801140340864001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.419 × 10⁹⁵(96-digit number)
14197216683535273466…82541602280681728001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.839 × 10⁹⁵(96-digit number)
28394433367070546933…65083204561363456001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.678 × 10⁹⁵(96-digit number)
56788866734141093867…30166409122726912001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.135 × 10⁹⁶(97-digit number)
11357773346828218773…60332818245453824001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.271 × 10⁹⁶(97-digit number)
22715546693656437547…20665636490907648001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.543 × 10⁹⁶(97-digit number)
45431093387312875094…41331272981815296001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.086 × 10⁹⁶(97-digit number)
90862186774625750188…82662545963630592001
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,702,755 XPM·at block #6,807,341 · 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.

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