Block #1,598,451

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/24/2016, 7:07:14 PM · Difficulty 10.6102 · 5,244,012 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bfa8c6cda1ff8abcd36c38c67d2991bd0fc3462306c7e20ffdfae50c3247eeba

Height

#1,598,451

Difficulty

10.610248

Transactions

4

Size

1.86 KB

Version

2

Bits

0a9c3931

Nonce

116,396,085

Timestamp

5/24/2016, 7:07:14 PM

Confirmations

5,244,012

Merkle Root

dfe216f6a66d91aae577ea41b63e790a1260d289abd2a97493e470984ea8d551
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.252 × 10⁹⁵(96-digit number)
12527034579525219477…11302216752853052639
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.252 × 10⁹⁵(96-digit number)
12527034579525219477…11302216752853052639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.505 × 10⁹⁵(96-digit number)
25054069159050438954…22604433505706105279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.010 × 10⁹⁵(96-digit number)
50108138318100877908…45208867011412210559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.002 × 10⁹⁶(97-digit number)
10021627663620175581…90417734022824421119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.004 × 10⁹⁶(97-digit number)
20043255327240351163…80835468045648842239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.008 × 10⁹⁶(97-digit number)
40086510654480702326…61670936091297684479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.017 × 10⁹⁶(97-digit number)
80173021308961404653…23341872182595368959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.603 × 10⁹⁷(98-digit number)
16034604261792280930…46683744365190737919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.206 × 10⁹⁷(98-digit number)
32069208523584561861…93367488730381475839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.413 × 10⁹⁷(98-digit number)
64138417047169123722…86734977460762951679
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,984,122 XPM·at block #6,842,462 · 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