Block #495,039

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/16/2014, 11:07:59 AM · Difficulty 10.7294 · 6,321,658 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
61a7813dc908c252a5f5ade2eddf9fe80f4b1407c56363db213a6805d67d5848

Height

#495,039

Difficulty

10.729393

Transactions

2

Size

1019 B

Version

2

Bits

0abab97c

Nonce

153,262

Timestamp

4/16/2014, 11:07:59 AM

Confirmations

6,321,658

Merkle Root

2149942004d577b6e964a5eb909a4a809d77c410c13ed025abde67e4e0ca3b7c
Transactions (2)
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.897 × 10⁹⁹(100-digit number)
28975758669691019231…39394696887362286081
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.897 × 10⁹⁹(100-digit number)
28975758669691019231…39394696887362286081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.795 × 10⁹⁹(100-digit number)
57951517339382038463…78789393774724572161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.159 × 10¹⁰⁰(101-digit number)
11590303467876407692…57578787549449144321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.318 × 10¹⁰⁰(101-digit number)
23180606935752815385…15157575098898288641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.636 × 10¹⁰⁰(101-digit number)
46361213871505630770…30315150197796577281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.272 × 10¹⁰⁰(101-digit number)
92722427743011261541…60630300395593154561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.854 × 10¹⁰¹(102-digit number)
18544485548602252308…21260600791186309121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.708 × 10¹⁰¹(102-digit number)
37088971097204504616…42521201582372618241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.417 × 10¹⁰¹(102-digit number)
74177942194409009233…85042403164745236481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.483 × 10¹⁰²(103-digit number)
14835588438881801846…70084806329490472961
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,777,698 XPM·at block #6,816,696 · 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