Block #304,912

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/11/2013, 4:38:32 AM · Difficulty 9.9935 · 6,502,239 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
637fbc522994152e6580c9be58b503df609184b6deed81e7e400dd2b50b33a52

Height

#304,912

Difficulty

9.993478

Transactions

1

Size

1.15 KB

Version

2

Bits

09fe5493

Nonce

13,925

Timestamp

12/11/2013, 4:38:32 AM

Confirmations

6,502,239

Merkle Root

863f614a4873377a1dd11fdc000c20edd8653ee5b5764c48b31569dd4993fd86
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.

1.205 × 10⁹⁸(99-digit number)
12051941132244693357…46960965941593742719
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
1.205 × 10⁹⁸(99-digit number)
12051941132244693357…46960965941593742719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.410 × 10⁹⁸(99-digit number)
24103882264489386715…93921931883187485439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.820 × 10⁹⁸(99-digit number)
48207764528978773430…87843863766374970879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.641 × 10⁹⁸(99-digit number)
96415529057957546860…75687727532749941759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.928 × 10⁹⁹(100-digit number)
19283105811591509372…51375455065499883519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.856 × 10⁹⁹(100-digit number)
38566211623183018744…02750910130999767039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.713 × 10⁹⁹(100-digit number)
77132423246366037488…05501820261999534079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.542 × 10¹⁰⁰(101-digit number)
15426484649273207497…11003640523999068159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.085 × 10¹⁰⁰(101-digit number)
30852969298546414995…22007281047998136319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.170 × 10¹⁰⁰(101-digit number)
61705938597092829990…44014562095996272639
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,701,214 XPM·at block #6,807,150 · 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