Block #2,558,381

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/10/2018, 7:57:14 AM · Difficulty 10.9917 · 4,272,857 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
95081d435cc5fb2e0865592354f44b8e25115ed467e0306839a9e5592aeba89f

Height

#2,558,381

Difficulty

10.991658

Transactions

7

Size

2.77 KB

Version

2

Bits

0afddd52

Nonce

1,642,092,481

Timestamp

3/10/2018, 7:57:14 AM

Confirmations

4,272,857

Merkle Root

11bc4966f1052b8b50505e5fa232dc478a623b4814c5f5056f8a02f98932de0f
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.912 × 10⁹⁵(96-digit number)
29122666456045116677…25924270952441540161
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.912 × 10⁹⁵(96-digit number)
29122666456045116677…25924270952441540161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.824 × 10⁹⁵(96-digit number)
58245332912090233355…51848541904883080321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.164 × 10⁹⁶(97-digit number)
11649066582418046671…03697083809766160641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.329 × 10⁹⁶(97-digit number)
23298133164836093342…07394167619532321281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.659 × 10⁹⁶(97-digit number)
46596266329672186684…14788335239064642561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.319 × 10⁹⁶(97-digit number)
93192532659344373368…29576670478129285121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.863 × 10⁹⁷(98-digit number)
18638506531868874673…59153340956258570241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.727 × 10⁹⁷(98-digit number)
37277013063737749347…18306681912517140481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.455 × 10⁹⁷(98-digit number)
74554026127475498694…36613363825034280961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.491 × 10⁹⁸(99-digit number)
14910805225495099738…73226727650068561921
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,894,053 XPM·at block #6,831,237 · 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