Block #2,462,454

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/7/2018, 9:45:47 PM · Difficulty 10.9571 · 4,352,690 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d9ca2e24dc1faa0077c2e5e4498059721e43cbf4a6cc414db70cbf799faaf394

Height

#2,462,454

Difficulty

10.957143

Transactions

2

Size

6.20 KB

Version

2

Bits

0af50759

Nonce

1,118,240,223

Timestamp

1/7/2018, 9:45:47 PM

Confirmations

4,352,690

Merkle Root

3b1a8f6753e9b98e911165b741ca1a50367c1ca13c744e67791e424d29c391b8
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.

2.391 × 10⁹⁵(96-digit number)
23917175545267828017…71231003234475980799
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.391 × 10⁹⁵(96-digit number)
23917175545267828017…71231003234475980799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.783 × 10⁹⁵(96-digit number)
47834351090535656034…42462006468951961599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.566 × 10⁹⁵(96-digit number)
95668702181071312068…84924012937903923199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.913 × 10⁹⁶(97-digit number)
19133740436214262413…69848025875807846399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.826 × 10⁹⁶(97-digit number)
38267480872428524827…39696051751615692799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.653 × 10⁹⁶(97-digit number)
76534961744857049654…79392103503231385599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.530 × 10⁹⁷(98-digit number)
15306992348971409930…58784207006462771199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.061 × 10⁹⁷(98-digit number)
30613984697942819861…17568414012925542399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.122 × 10⁹⁷(98-digit number)
61227969395885639723…35136828025851084799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.224 × 10⁹⁸(99-digit number)
12245593879177127944…70273656051702169599
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,765,246 XPM·at block #6,815,143 · 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