Block #600,987

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/25/2014, 4:35:46 AM · Difficulty 10.9157 · 6,205,381 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ff950680eb4a28508f4f2779d81359e25f92836c6cea4c5b55df4c4d3f899094

Height

#600,987

Difficulty

10.915728

Transactions

6

Size

2.61 KB

Version

2

Bits

0aea6d25

Nonce

1,622,928,698

Timestamp

6/25/2014, 4:35:46 AM

Confirmations

6,205,381

Merkle Root

576ca2097259ff1b61ffc5bec4e38781f453490509843617d8d65feefa607b80
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.750 × 10⁹⁷(98-digit number)
17508469767716889402…42181088045243711331
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.750 × 10⁹⁷(98-digit number)
17508469767716889402…42181088045243711331
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.501 × 10⁹⁷(98-digit number)
35016939535433778804…84362176090487422661
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.003 × 10⁹⁷(98-digit number)
70033879070867557609…68724352180974845321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.400 × 10⁹⁸(99-digit number)
14006775814173511521…37448704361949690641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.801 × 10⁹⁸(99-digit number)
28013551628347023043…74897408723899381281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.602 × 10⁹⁸(99-digit number)
56027103256694046087…49794817447798762561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.120 × 10⁹⁹(100-digit number)
11205420651338809217…99589634895597525121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.241 × 10⁹⁹(100-digit number)
22410841302677618434…99179269791195050241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.482 × 10⁹⁹(100-digit number)
44821682605355236869…98358539582390100481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.964 × 10⁹⁹(100-digit number)
89643365210710473739…96717079164780200961
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,695,032 XPM·at block #6,806,367 · 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