Block #494,838

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/16/2014, 8:45:45 AM · Difficulty 10.7261 · 6,317,998 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ee5e96915cecb9fc690a3b7ba38e19a78a4d83783519d2114aecd91f5bb15b88

Height

#494,838

Difficulty

10.726125

Transactions

7

Size

36.81 KB

Version

2

Bits

0ab9e352

Nonce

101,331,672

Timestamp

4/16/2014, 8:45:45 AM

Confirmations

6,317,998

Merkle Root

47879d0712e6648700556c1258feef7e285f56ecda60e4adc1d73843303deeec
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.705 × 10⁹⁹(100-digit number)
27054876910438439018…06971479406418554881
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.705 × 10⁹⁹(100-digit number)
27054876910438439018…06971479406418554881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.410 × 10⁹⁹(100-digit number)
54109753820876878037…13942958812837109761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.082 × 10¹⁰⁰(101-digit number)
10821950764175375607…27885917625674219521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.164 × 10¹⁰⁰(101-digit number)
21643901528350751215…55771835251348439041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.328 × 10¹⁰⁰(101-digit number)
43287803056701502430…11543670502696878081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.657 × 10¹⁰⁰(101-digit number)
86575606113403004860…23087341005393756161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.731 × 10¹⁰¹(102-digit number)
17315121222680600972…46174682010787512321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.463 × 10¹⁰¹(102-digit number)
34630242445361201944…92349364021575024641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.926 × 10¹⁰¹(102-digit number)
69260484890722403888…84698728043150049281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.385 × 10¹⁰²(103-digit number)
13852096978144480777…69397456086300098561
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,746,733 XPM·at block #6,812,835 · 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