Block #599,754

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/23/2014, 9:09:06 PM · Difficulty 10.9259 · 6,226,938 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b49ca24fc069bcebb329d96424e592c938083154b886367d275cd26c797eb4a9

Height

#599,754

Difficulty

10.925927

Transactions

7

Size

2.12 KB

Version

2

Bits

0aed0989

Nonce

314,778,573

Timestamp

6/23/2014, 9:09:06 PM

Confirmations

6,226,938

Merkle Root

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

8.003 × 10⁹⁰(91-digit number)
80030631618561361747…31474030082904453561
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
8.003 × 10⁹⁰(91-digit number)
80030631618561361747…31474030082904453561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.600 × 10⁹¹(92-digit number)
16006126323712272349…62948060165808907121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.201 × 10⁹¹(92-digit number)
32012252647424544698…25896120331617814241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.402 × 10⁹¹(92-digit number)
64024505294849089397…51792240663235628481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.280 × 10⁹²(93-digit number)
12804901058969817879…03584481326471256961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.560 × 10⁹²(93-digit number)
25609802117939635759…07168962652942513921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.121 × 10⁹²(93-digit number)
51219604235879271518…14337925305885027841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.024 × 10⁹³(94-digit number)
10243920847175854303…28675850611770055681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.048 × 10⁹³(94-digit number)
20487841694351708607…57351701223540111361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.097 × 10⁹³(94-digit number)
40975683388703417214…14703402447080222721
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,857,687 XPM·at block #6,826,691 · 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