Block #2,576,245

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/20/2018, 5:47:45 PM · Difficulty 10.9957 · 4,267,656 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2e9ad5ad9e04e089be8f5a2bc51e0566c509cb76862bcf7b380332fa7f8c393a

Height

#2,576,245

Difficulty

10.995676

Transactions

8

Size

1.51 KB

Version

2

Bits

0afee49b

Nonce

174,380,804

Timestamp

3/20/2018, 5:47:45 PM

Confirmations

4,267,656

Merkle Root

019513e1b05931437a2de351d3589c839e975c4a1cb8e3a4d0cf23f7a7c467e0
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.488 × 10⁹⁶(97-digit number)
24888947008280321672…17477105245754982399
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.488 × 10⁹⁶(97-digit number)
24888947008280321672…17477105245754982399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.977 × 10⁹⁶(97-digit number)
49777894016560643345…34954210491509964799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.955 × 10⁹⁶(97-digit number)
99555788033121286691…69908420983019929599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.991 × 10⁹⁷(98-digit number)
19911157606624257338…39816841966039859199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.982 × 10⁹⁷(98-digit number)
39822315213248514676…79633683932079718399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.964 × 10⁹⁷(98-digit number)
79644630426497029352…59267367864159436799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.592 × 10⁹⁸(99-digit number)
15928926085299405870…18534735728318873599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.185 × 10⁹⁸(99-digit number)
31857852170598811741…37069471456637747199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.371 × 10⁹⁸(99-digit number)
63715704341197623482…74138942913275494399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.274 × 10⁹⁹(100-digit number)
12743140868239524696…48277885826550988799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.548 × 10⁹⁹(100-digit number)
25486281736479049392…96555771653101977599
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,995,579 XPM·at block #6,843,900 · 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