Block #629,804

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/12/2014, 2:08:06 PM · Difficulty 10.9607 · 6,180,584 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fcee1d083fc01fd93b0c8ae3dcff4b4d9ec268e7c0794a78cdee0a9d834613ff

Height

#629,804

Difficulty

10.960727

Transactions

4

Size

1.19 KB

Version

2

Bits

0af5f231

Nonce

192,400,299

Timestamp

7/12/2014, 2:08:06 PM

Confirmations

6,180,584

Merkle Root

01fa1e5bc3bb632f7885b29b2d5b26d18b42fd2949e97c30ef49fa6175d78de2
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.714 × 10⁹⁷(98-digit number)
27147117335213757596…70065698530529943041
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.714 × 10⁹⁷(98-digit number)
27147117335213757596…70065698530529943041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.429 × 10⁹⁷(98-digit number)
54294234670427515193…40131397061059886081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.085 × 10⁹⁸(99-digit number)
10858846934085503038…80262794122119772161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.171 × 10⁹⁸(99-digit number)
21717693868171006077…60525588244239544321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.343 × 10⁹⁸(99-digit number)
43435387736342012154…21051176488479088641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.687 × 10⁹⁸(99-digit number)
86870775472684024309…42102352976958177281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.737 × 10⁹⁹(100-digit number)
17374155094536804861…84204705953916354561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.474 × 10⁹⁹(100-digit number)
34748310189073609723…68409411907832709121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.949 × 10⁹⁹(100-digit number)
69496620378147219447…36818823815665418241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.389 × 10¹⁰⁰(101-digit number)
13899324075629443889…73637647631330836481
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,727,181 XPM·at block #6,810,387 · 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