Block #294,611

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/4/2013, 11:18:52 PM · Difficulty 9.9911 · 6,515,516 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8a0309192f533914346f7de198ca840ca0a797b08c66aa1da3c11835ec267492

Height

#294,611

Difficulty

9.991112

Transactions

2

Size

1.62 KB

Version

2

Bits

09fdb980

Nonce

71,076

Timestamp

12/4/2013, 11:18:52 PM

Confirmations

6,515,516

Merkle Root

b39d8ffe42f89981f789f4883bb6b81be0bb5b0494deb44ffadc1bc721a91979
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.

6.630 × 10⁹³(94-digit number)
66307896239054272893…08516532790399092481
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
6.630 × 10⁹³(94-digit number)
66307896239054272893…08516532790399092481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.326 × 10⁹⁴(95-digit number)
13261579247810854578…17033065580798184961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.652 × 10⁹⁴(95-digit number)
26523158495621709157…34066131161596369921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.304 × 10⁹⁴(95-digit number)
53046316991243418314…68132262323192739841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.060 × 10⁹⁵(96-digit number)
10609263398248683662…36264524646385479681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.121 × 10⁹⁵(96-digit number)
21218526796497367325…72529049292770959361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.243 × 10⁹⁵(96-digit number)
42437053592994734651…45058098585541918721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.487 × 10⁹⁵(96-digit number)
84874107185989469303…90116197171083837441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.697 × 10⁹⁶(97-digit number)
16974821437197893860…80232394342167674881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.394 × 10⁹⁶(97-digit number)
33949642874395787721…60464788684335349761
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,725,089 XPM·at block #6,810,126 · 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