Block #2,139,620

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/31/2017, 8:39:18 PM · Difficulty 10.8785 · 4,687,786 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8c6eef101deae845ff21354f6e37ee797b098b8d017cc314c39ece34ac22d3d8

Height

#2,139,620

Difficulty

10.878483

Transactions

2

Size

5.62 KB

Version

2

Bits

0ae0e449

Nonce

1,367,879,303

Timestamp

5/31/2017, 8:39:18 PM

Confirmations

4,687,786

Merkle Root

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

3.374 × 10⁹⁵(96-digit number)
33745196584336710026…54479251674554368001
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.374 × 10⁹⁵(96-digit number)
33745196584336710026…54479251674554368001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.749 × 10⁹⁵(96-digit number)
67490393168673420053…08958503349108736001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.349 × 10⁹⁶(97-digit number)
13498078633734684010…17917006698217472001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.699 × 10⁹⁶(97-digit number)
26996157267469368021…35834013396434944001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.399 × 10⁹⁶(97-digit number)
53992314534938736042…71668026792869888001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.079 × 10⁹⁷(98-digit number)
10798462906987747208…43336053585739776001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.159 × 10⁹⁷(98-digit number)
21596925813975494417…86672107171479552001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.319 × 10⁹⁷(98-digit number)
43193851627950988834…73344214342959104001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.638 × 10⁹⁷(98-digit number)
86387703255901977668…46688428685918208001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.727 × 10⁹⁸(99-digit number)
17277540651180395533…93376857371836416001
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,863,353 XPM·at block #6,827,405 · 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