Block #592,429

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/17/2014, 9:07:44 PM · Difficulty 10.9428 · 6,217,208 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
72150184c032797c314d482d1fd5f90e8e9b817957f49cc88e8b2a26ecea5514

Height

#592,429

Difficulty

10.942764

Transactions

8

Size

3.31 KB

Version

2

Bits

0af158f7

Nonce

3,163,780,975

Timestamp

6/17/2014, 9:07:44 PM

Confirmations

6,217,208

Merkle Root

408b2d3bb37886fb53b532f510589b97ac620182471308442b846f39a83b56f7
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.

2.731 × 10⁹⁸(99-digit number)
27311759039817304470…13777412051213746401
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
2.731 × 10⁹⁸(99-digit number)
27311759039817304470…13777412051213746401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.462 × 10⁹⁸(99-digit number)
54623518079634608941…27554824102427492801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.092 × 10⁹⁹(100-digit number)
10924703615926921788…55109648204854985601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.184 × 10⁹⁹(100-digit number)
21849407231853843576…10219296409709971201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.369 × 10⁹⁹(100-digit number)
43698814463707687153…20438592819419942401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.739 × 10⁹⁹(100-digit number)
87397628927415374306…40877185638839884801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.747 × 10¹⁰⁰(101-digit number)
17479525785483074861…81754371277679769601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.495 × 10¹⁰⁰(101-digit number)
34959051570966149722…63508742555359539201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.991 × 10¹⁰⁰(101-digit number)
69918103141932299444…27017485110719078401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.398 × 10¹⁰¹(102-digit number)
13983620628386459888…54034970221438156801
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,721,174 XPM·at block #6,809,636 · 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.

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