Block #2,266,462

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/24/2017, 10:54:57 PM · Difficulty 10.9515 · 4,576,664 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4cdeae833ca00634e3457c0c0c373f2c1829f200d3ed4d32b57762c44a4e1ac4

Height

#2,266,462

Difficulty

10.951462

Transactions

2

Size

1.28 KB

Version

2

Bits

0af39306

Nonce

79,422,432

Timestamp

8/24/2017, 10:54:57 PM

Confirmations

4,576,664

Merkle Root

2d30c06fd507e14b7b09f159c4e6b89f779c0bb572eb85a01aea31e804c86125
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.

1.208 × 10⁹⁵(96-digit number)
12085719400648725334…03099812815892710399
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.208 × 10⁹⁵(96-digit number)
12085719400648725334…03099812815892710399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.417 × 10⁹⁵(96-digit number)
24171438801297450669…06199625631785420799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.834 × 10⁹⁵(96-digit number)
48342877602594901339…12399251263570841599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.668 × 10⁹⁵(96-digit number)
96685755205189802678…24798502527141683199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.933 × 10⁹⁶(97-digit number)
19337151041037960535…49597005054283366399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.867 × 10⁹⁶(97-digit number)
38674302082075921071…99194010108566732799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.734 × 10⁹⁶(97-digit number)
77348604164151842142…98388020217133465599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.546 × 10⁹⁷(98-digit number)
15469720832830368428…96776040434266931199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.093 × 10⁹⁷(98-digit number)
30939441665660736857…93552080868533862399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.187 × 10⁹⁷(98-digit number)
61878883331321473714…87104161737067724799
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,989,374 XPM·at block #6,843,125 · 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