Block #418,808

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 2/25/2014, 4:19:31 AM · Difficulty 10.3833 · 6,391,469 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
39c63e29311131be41f99266f2429ea77f0d1f7b6455e248a97d73a78fc2ebdf

Height

#418,808

Difficulty

10.383308

Transactions

2

Size

2.38 KB

Version

2

Bits

0a622079

Nonce

336,246

Timestamp

2/25/2014, 4:19:31 AM

Confirmations

6,391,469

Merkle Root

48e77c99c54e3652ece80a7b71d2703351d348f57ffa9e1fd61ac2cd6190125e
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.

4.003 × 10¹⁰⁰(101-digit number)
40032057629199832759…14990809403084636159
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
4.003 × 10¹⁰⁰(101-digit number)
40032057629199832759…14990809403084636159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.006 × 10¹⁰⁰(101-digit number)
80064115258399665518…29981618806169272319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.601 × 10¹⁰¹(102-digit number)
16012823051679933103…59963237612338544639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.202 × 10¹⁰¹(102-digit number)
32025646103359866207…19926475224677089279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.405 × 10¹⁰¹(102-digit number)
64051292206719732414…39852950449354178559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.281 × 10¹⁰²(103-digit number)
12810258441343946482…79705900898708357119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.562 × 10¹⁰²(103-digit number)
25620516882687892965…59411801797416714239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.124 × 10¹⁰²(103-digit number)
51241033765375785931…18823603594833428479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.024 × 10¹⁰³(104-digit number)
10248206753075157186…37647207189666856959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.049 × 10¹⁰³(104-digit number)
20496413506150314372…75294414379333713919
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,726,289 XPM·at block #6,810,276 · 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