Block #2,558,264

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/10/2018, 6:14:50 AM · Difficulty 10.9916 · 4,272,973 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
415b63b659792477e3d9b0cb132dba26e9ba74375044b6be1f667469b1d71cef

Height

#2,558,264

Difficulty

10.991635

Transactions

4

Size

1.37 KB

Version

2

Bits

0afddbcf

Nonce

1,594,293,921

Timestamp

3/10/2018, 6:14:50 AM

Confirmations

4,272,973

Merkle Root

30ace812d94de9034d23540989700cdbadb2dc9b5b64f5cd72331704ba756c44
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.366 × 10⁹⁵(96-digit number)
13667994293773776326…01315701554969743681
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.366 × 10⁹⁵(96-digit number)
13667994293773776326…01315701554969743681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.733 × 10⁹⁵(96-digit number)
27335988587547552653…02631403109939487361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.467 × 10⁹⁵(96-digit number)
54671977175095105307…05262806219878974721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.093 × 10⁹⁶(97-digit number)
10934395435019021061…10525612439757949441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.186 × 10⁹⁶(97-digit number)
21868790870038042122…21051224879515898881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.373 × 10⁹⁶(97-digit number)
43737581740076084245…42102449759031797761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.747 × 10⁹⁶(97-digit number)
87475163480152168491…84204899518063595521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.749 × 10⁹⁷(98-digit number)
17495032696030433698…68409799036127191041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.499 × 10⁹⁷(98-digit number)
34990065392060867396…36819598072254382081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.998 × 10⁹⁷(98-digit number)
69980130784121734793…73639196144508764161
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,045 XPM·at block #6,831,236 · 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