Block #2,217,460

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/22/2017, 8:52:02 AM · Difficulty 10.9433 · 4,609,501 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a5e5d59cb5ba4158bd307aa9fc5aecbb1d3c23b009685db585f54cde9a596fa2

Height

#2,217,460

Difficulty

10.943281

Transactions

2

Size

871 B

Version

2

Bits

0af17ae0

Nonce

232,207,616

Timestamp

7/22/2017, 8:52:02 AM

Confirmations

4,609,501

Merkle Root

740dabbd0b4c3ac9c35586d9653a741b37e37b7a534ebec1eea17e4dd83f559a
Transactions (2)
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.934 × 10⁹⁵(96-digit number)
49345676871217040305…38217208377958179201
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.934 × 10⁹⁵(96-digit number)
49345676871217040305…38217208377958179201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.869 × 10⁹⁵(96-digit number)
98691353742434080610…76434416755916358401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.973 × 10⁹⁶(97-digit number)
19738270748486816122…52868833511832716801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.947 × 10⁹⁶(97-digit number)
39476541496973632244…05737667023665433601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.895 × 10⁹⁶(97-digit number)
78953082993947264488…11475334047330867201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.579 × 10⁹⁷(98-digit number)
15790616598789452897…22950668094661734401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.158 × 10⁹⁷(98-digit number)
31581233197578905795…45901336189323468801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.316 × 10⁹⁷(98-digit number)
63162466395157811590…91802672378646937601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.263 × 10⁹⁸(99-digit number)
12632493279031562318…83605344757293875201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.526 × 10⁹⁸(99-digit number)
25264986558063124636…67210689514587750401
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,859,864 XPM·at block #6,826,960 · 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