Block #2,582,101

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/24/2018, 2:59:02 AM · Difficulty 11.1099 · 4,258,978 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cd98368e0abe2ef6d10bb6e749d734812633ae52a7415c8778e3aeb9ad188964

Height

#2,582,101

Difficulty

11.109923

Transactions

8

Size

1.96 KB

Version

2

Bits

0b1c23e7

Nonce

106,863,835

Timestamp

3/24/2018, 2:59:02 AM

Confirmations

4,258,978

Merkle Root

b299407387647af25a52bd5568e8a64404a0757b6f981b79455da368511eb639
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.

8.269 × 10⁹⁷(98-digit number)
82698499087214372930…40266926659699998719
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
8.269 × 10⁹⁷(98-digit number)
82698499087214372930…40266926659699998719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.653 × 10⁹⁸(99-digit number)
16539699817442874586…80533853319399997439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.307 × 10⁹⁸(99-digit number)
33079399634885749172…61067706638799994879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.615 × 10⁹⁸(99-digit number)
66158799269771498344…22135413277599989759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.323 × 10⁹⁹(100-digit number)
13231759853954299668…44270826555199979519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.646 × 10⁹⁹(100-digit number)
26463519707908599337…88541653110399959039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.292 × 10⁹⁹(100-digit number)
52927039415817198675…77083306220799918079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.058 × 10¹⁰⁰(101-digit number)
10585407883163439735…54166612441599836159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.117 × 10¹⁰⁰(101-digit number)
21170815766326879470…08333224883199672319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.234 × 10¹⁰⁰(101-digit number)
42341631532653758940…16666449766399344639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.468 × 10¹⁰⁰(101-digit number)
84683263065307517880…33332899532798689279
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,972,995 XPM·at block #6,841,078 · 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