Block #2,233,259

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/2/2017, 4:40:14 AM · Difficulty 10.9461 · 4,608,596 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7b7fa5fe4feb545c6c58b31d917e7130833f7f01d1add9fdf72c2a46b63eed14

Height

#2,233,259

Difficulty

10.946099

Transactions

2

Size

721 B

Version

2

Bits

0af2338c

Nonce

164,793,211

Timestamp

8/2/2017, 4:40:14 AM

Confirmations

4,608,596

Merkle Root

38d83611cc7758625f430f589a27acde18e884a51d55061a95cfe657e570aa94
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.

4.542 × 10⁹⁴(95-digit number)
45429999016240800441…22980715560300336639
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.542 × 10⁹⁴(95-digit number)
45429999016240800441…22980715560300336639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.085 × 10⁹⁴(95-digit number)
90859998032481600883…45961431120600673279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.817 × 10⁹⁵(96-digit number)
18171999606496320176…91922862241201346559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.634 × 10⁹⁵(96-digit number)
36343999212992640353…83845724482402693119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.268 × 10⁹⁵(96-digit number)
72687998425985280707…67691448964805386239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.453 × 10⁹⁶(97-digit number)
14537599685197056141…35382897929610772479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.907 × 10⁹⁶(97-digit number)
29075199370394112282…70765795859221544959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.815 × 10⁹⁶(97-digit number)
58150398740788224565…41531591718443089919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.163 × 10⁹⁷(98-digit number)
11630079748157644913…83063183436886179839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.326 × 10⁹⁷(98-digit number)
23260159496315289826…66126366873772359679
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,979,216 XPM·at block #6,841,854 · 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