Block #296,167

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/5/2013, 8:32:08 PM · Difficulty 9.9917 · 6,520,444 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d83d08498597a9f075567613e13e3e3c3a1a3bed893eb0c7166d8f39f1834b57

Height

#296,167

Difficulty

9.991651

Transactions

14

Size

6.59 KB

Version

2

Bits

09fddcd8

Nonce

20,740

Timestamp

12/5/2013, 8:32:08 PM

Confirmations

6,520,444

Merkle Root

637b114dc3f8a41cac91f022044736f1c37e14f27c5598f1412940392fa2cfd2
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.

4.222 × 10⁹⁴(95-digit number)
42223707651334907979…35323192111478614081
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
4.222 × 10⁹⁴(95-digit number)
42223707651334907979…35323192111478614081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.444 × 10⁹⁴(95-digit number)
84447415302669815959…70646384222957228161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.688 × 10⁹⁵(96-digit number)
16889483060533963191…41292768445914456321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.377 × 10⁹⁵(96-digit number)
33778966121067926383…82585536891828912641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.755 × 10⁹⁵(96-digit number)
67557932242135852767…65171073783657825281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.351 × 10⁹⁶(97-digit number)
13511586448427170553…30342147567315650561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.702 × 10⁹⁶(97-digit number)
27023172896854341106…60684295134631301121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.404 × 10⁹⁶(97-digit number)
54046345793708682213…21368590269262602241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.080 × 10⁹⁷(98-digit number)
10809269158741736442…42737180538525204481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.161 × 10⁹⁷(98-digit number)
21618538317483472885…85474361077050408961
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,009 XPM·at block #6,816,610 · 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