Block #1,041,616

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/2/2015, 11:46:25 AM · Difficulty 10.7245 · 5,775,291 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ecab09209388e95036a17d17b1c42c6d42ed08867e1794f7688a62deae49ad87

Height

#1,041,616

Difficulty

10.724535

Transactions

10

Size

2.30 KB

Version

2

Bits

0ab97b1f

Nonce

2,006,371,940

Timestamp

5/2/2015, 11:46:25 AM

Confirmations

5,775,291

Merkle Root

ffa43abf6c30d4cc77e00678d9702ad54916b42afbab7b06537185b01344b212
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.337 × 10⁹⁸(99-digit number)
23376128275621492086…01534703368297164799
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.337 × 10⁹⁸(99-digit number)
23376128275621492086…01534703368297164799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.675 × 10⁹⁸(99-digit number)
46752256551242984173…03069406736594329599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.350 × 10⁹⁸(99-digit number)
93504513102485968346…06138813473188659199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.870 × 10⁹⁹(100-digit number)
18700902620497193669…12277626946377318399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.740 × 10⁹⁹(100-digit number)
37401805240994387338…24555253892754636799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.480 × 10⁹⁹(100-digit number)
74803610481988774677…49110507785509273599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.496 × 10¹⁰⁰(101-digit number)
14960722096397754935…98221015571018547199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.992 × 10¹⁰⁰(101-digit number)
29921444192795509870…96442031142037094399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.984 × 10¹⁰⁰(101-digit number)
59842888385591019741…92884062284074188799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.196 × 10¹⁰¹(102-digit number)
11968577677118203948…85768124568148377599
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,779,297 XPM·at block #6,816,906 · 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