Block #1,289,097

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/19/2015, 9:50:15 PM · Difficulty 10.8286 · 5,538,058 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e8108b3a5f9bf5c2418b07999adeff54420c2e67574daf2d706464bc9f34767c

Height

#1,289,097

Difficulty

10.828559

Transactions

17

Size

4.16 KB

Version

2

Bits

0ad41c75

Nonce

1,360,247,045

Timestamp

10/19/2015, 9:50:15 PM

Confirmations

5,538,058

Merkle Root

5759e7be2135599fea264ec4fdf8a5e12b340721fd04d3e9e8a9ac2936f67287
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.817 × 10⁹⁶(97-digit number)
18173125678757212432…60084518640306132161
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.817 × 10⁹⁶(97-digit number)
18173125678757212432…60084518640306132161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.634 × 10⁹⁶(97-digit number)
36346251357514424865…20169037280612264321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.269 × 10⁹⁶(97-digit number)
72692502715028849731…40338074561224528641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.453 × 10⁹⁷(98-digit number)
14538500543005769946…80676149122449057281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.907 × 10⁹⁷(98-digit number)
29077001086011539892…61352298244898114561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.815 × 10⁹⁷(98-digit number)
58154002172023079785…22704596489796229121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.163 × 10⁹⁸(99-digit number)
11630800434404615957…45409192979592458241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.326 × 10⁹⁸(99-digit number)
23261600868809231914…90818385959184916481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.652 × 10⁹⁸(99-digit number)
46523201737618463828…81636771918369832961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.304 × 10⁹⁸(99-digit number)
93046403475236927656…63273543836739665921
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,861,424 XPM·at block #6,827,154 · 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