Block #2,137,297

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/29/2017, 10:20:21 PM · Difficulty 10.8889 · 4,707,690 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
df982d20f3494d6db61b368a21958ebf3865cf10af3e85f0af0a90726f3192bb

Height

#2,137,297

Difficulty

10.888923

Transactions

2

Size

3.16 KB

Version

2

Bits

0ae3907a

Nonce

462,151,451

Timestamp

5/29/2017, 10:20:21 PM

Confirmations

4,707,690

Merkle Root

b876912a2ea7ce6bcdec244ebaffaec94ec99532c0be02e5ba8ca228225e6806
Transactions (2)
1 in → 1 out8.4700 XPM109 B
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.500 × 10⁹⁵(96-digit number)
15001892678122479906…32204650719250800641
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.500 × 10⁹⁵(96-digit number)
15001892678122479906…32204650719250800641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.000 × 10⁹⁵(96-digit number)
30003785356244959812…64409301438501601281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.000 × 10⁹⁵(96-digit number)
60007570712489919625…28818602877003202561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.200 × 10⁹⁶(97-digit number)
12001514142497983925…57637205754006405121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.400 × 10⁹⁶(97-digit number)
24003028284995967850…15274411508012810241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.800 × 10⁹⁶(97-digit number)
48006056569991935700…30548823016025620481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.601 × 10⁹⁶(97-digit number)
96012113139983871400…61097646032051240961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.920 × 10⁹⁷(98-digit number)
19202422627996774280…22195292064102481921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.840 × 10⁹⁷(98-digit number)
38404845255993548560…44390584128204963841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.680 × 10⁹⁷(98-digit number)
76809690511987097120…88781168256409927681
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:58,004,315 XPM·at block #6,844,986 · 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