Block #498,315

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/18/2014, 1:15:44 AM · Difficulty 10.7780 · 6,311,398 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2522f864f881e4cf3f21a44ca3dde13a6c3c7aff7e8e90de4a489a78b812ffe9

Height

#498,315

Difficulty

10.777980

Transactions

2

Size

616 B

Version

2

Bits

0ac729b9

Nonce

619,172

Timestamp

4/18/2014, 1:15:44 AM

Confirmations

6,311,398

Merkle Root

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

6.508 × 10⁹⁹(100-digit number)
65085674250384940580…69282463295694688001
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
6.508 × 10⁹⁹(100-digit number)
65085674250384940580…69282463295694688001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.301 × 10¹⁰⁰(101-digit number)
13017134850076988116…38564926591389376001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.603 × 10¹⁰⁰(101-digit number)
26034269700153976232…77129853182778752001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.206 × 10¹⁰⁰(101-digit number)
52068539400307952464…54259706365557504001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.041 × 10¹⁰¹(102-digit number)
10413707880061590492…08519412731115008001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.082 × 10¹⁰¹(102-digit number)
20827415760123180985…17038825462230016001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.165 × 10¹⁰¹(102-digit number)
41654831520246361971…34077650924460032001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.330 × 10¹⁰¹(102-digit number)
83309663040492723942…68155301848920064001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.666 × 10¹⁰²(103-digit number)
16661932608098544788…36310603697840128001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.332 × 10¹⁰²(103-digit number)
33323865216197089576…72621207395680256001
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,721,783 XPM·at block #6,809,712 · 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