Block #2,544,082

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/1/2018, 2:57:39 PM · Difficulty 10.9877 · 4,273,109 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
044d67df98d2208a5760536854fcce555dbe6079d263a2702cb15c9d24cbf114

Height

#2,544,082

Difficulty

10.987674

Transactions

5

Size

1.49 KB

Version

2

Bits

0afcd837

Nonce

473,347,159

Timestamp

3/1/2018, 2:57:39 PM

Confirmations

4,273,109

Merkle Root

ab437f718a773d2c706c51416b52087ba59e805f10e09646c2db9fc164fefe0c
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.088 × 10⁹⁵(96-digit number)
20887903138785627007…92179755290711103999
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.088 × 10⁹⁵(96-digit number)
20887903138785627007…92179755290711103999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.177 × 10⁹⁵(96-digit number)
41775806277571254015…84359510581422207999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.355 × 10⁹⁵(96-digit number)
83551612555142508030…68719021162844415999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.671 × 10⁹⁶(97-digit number)
16710322511028501606…37438042325688831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.342 × 10⁹⁶(97-digit number)
33420645022057003212…74876084651377663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.684 × 10⁹⁶(97-digit number)
66841290044114006424…49752169302755327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.336 × 10⁹⁷(98-digit number)
13368258008822801284…99504338605510655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.673 × 10⁹⁷(98-digit number)
26736516017645602569…99008677211021311999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.347 × 10⁹⁷(98-digit number)
53473032035291205139…98017354422042623999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.069 × 10⁹⁸(99-digit number)
10694606407058241027…96034708844085247999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.138 × 10⁹⁸(99-digit number)
21389212814116482055…92069417688170495999
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,781,564 XPM·at block #6,817,190 · 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