Block #2,457,381

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/4/2018, 2:38:35 PM · Difficulty 10.9541 · 4,386,161 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f32a2cdb5d18165818cc31c1887c424e3814ca5f6b820c5cb03f92dc695f070b

Height

#2,457,381

Difficulty

10.954124

Transactions

37

Size

7.80 KB

Version

2

Bits

0af44173

Nonce

244,987,913

Timestamp

1/4/2018, 2:38:35 PM

Confirmations

4,386,161

Merkle Root

a71106d0bf67ba22adcd2fe238876ddb9245bf800667e274560511fe8ed1b5f6
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.577 × 10⁹⁶(97-digit number)
15775199032940264545…61222918985391503359
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.577 × 10⁹⁶(97-digit number)
15775199032940264545…61222918985391503359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.155 × 10⁹⁶(97-digit number)
31550398065880529090…22445837970783006719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.310 × 10⁹⁶(97-digit number)
63100796131761058181…44891675941566013439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.262 × 10⁹⁷(98-digit number)
12620159226352211636…89783351883132026879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.524 × 10⁹⁷(98-digit number)
25240318452704423272…79566703766264053759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.048 × 10⁹⁷(98-digit number)
50480636905408846544…59133407532528107519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.009 × 10⁹⁸(99-digit number)
10096127381081769308…18266815065056215039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.019 × 10⁹⁸(99-digit number)
20192254762163538617…36533630130112430079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.038 × 10⁹⁸(99-digit number)
40384509524327077235…73067260260224860159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.076 × 10⁹⁸(99-digit number)
80769019048654154471…46134520520449720319
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,992,711 XPM·at block #6,843,541 · 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