Block #289,095

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/2/2013, 1:22:58 AM · Difficulty 9.9882 · 6,527,587 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3d5a64e92cdeffe883794060e123458a12acddcf649f668e74afe8a761ccbc33

Height

#289,095

Difficulty

9.988245

Transactions

1

Size

1.01 KB

Version

2

Bits

09fcfd9c

Nonce

186,261

Timestamp

12/2/2013, 1:22:58 AM

Confirmations

6,527,587

Merkle Root

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

3.305 × 10⁹⁵(96-digit number)
33058292537166688157…37987533686221968961
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
3.305 × 10⁹⁵(96-digit number)
33058292537166688157…37987533686221968961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.611 × 10⁹⁵(96-digit number)
66116585074333376315…75975067372443937921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.322 × 10⁹⁶(97-digit number)
13223317014866675263…51950134744887875841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.644 × 10⁹⁶(97-digit number)
26446634029733350526…03900269489775751681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.289 × 10⁹⁶(97-digit number)
52893268059466701052…07800538979551503361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.057 × 10⁹⁷(98-digit number)
10578653611893340210…15601077959103006721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.115 × 10⁹⁷(98-digit number)
21157307223786680420…31202155918206013441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.231 × 10⁹⁷(98-digit number)
42314614447573360841…62404311836412026881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.462 × 10⁹⁷(98-digit number)
84629228895146721683…24808623672824053761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.692 × 10⁹⁸(99-digit number)
16925845779029344336…49617247345648107521
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,576 XPM·at block #6,816,681 · 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