Block #2,451,467

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/31/2017, 7:39:46 PM · Difficulty 10.9496 · 4,390,392 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7620ca3a0954564ae015f996ed472189911b6ccee3600b22b8609306dc09b90d

Height

#2,451,467

Difficulty

10.949601

Transactions

2

Size

1.43 KB

Version

2

Bits

0af3190a

Nonce

1,445,787,238

Timestamp

12/31/2017, 7:39:46 PM

Confirmations

4,390,392

Merkle Root

654be205d9a4e2efc16d6b8f9fbd52309e4c0343c959da8ff6632205c883b00d
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.

1.745 × 10⁹⁴(95-digit number)
17454301862476791213…53483093923079253069
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.745 × 10⁹⁴(95-digit number)
17454301862476791213…53483093923079253069
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.490 × 10⁹⁴(95-digit number)
34908603724953582426…06966187846158506139
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.981 × 10⁹⁴(95-digit number)
69817207449907164853…13932375692317012279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.396 × 10⁹⁵(96-digit number)
13963441489981432970…27864751384634024559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.792 × 10⁹⁵(96-digit number)
27926882979962865941…55729502769268049119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.585 × 10⁹⁵(96-digit number)
55853765959925731882…11459005538536098239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.117 × 10⁹⁶(97-digit number)
11170753191985146376…22918011077072196479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.234 × 10⁹⁶(97-digit number)
22341506383970292753…45836022154144392959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.468 × 10⁹⁶(97-digit number)
44683012767940585506…91672044308288785919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.936 × 10⁹⁶(97-digit number)
89366025535881171012…83344088616577571839
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,979,249 XPM·at block #6,841,858 · 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