Block #2,526,456

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/18/2018, 4:38:05 AM · Difficulty 10.9839 · 4,315,051 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
bc2a4eaf0e299a9c5e1169273a0c34ce067f5e4a241ad22b66accf2cc1d08231

Height

#2,526,456

Difficulty

10.983867

Transactions

8

Size

2.61 KB

Version

2

Bits

0afbdeae

Nonce

1,443,945,936

Timestamp

2/18/2018, 4:38:05 AM

Confirmations

4,315,051

Merkle Root

e3596ec48ac90a3130d305a5936712c1f457c8d9ce45fd73124b256d83019121
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.480 × 10⁹⁵(96-digit number)
24801972405548825738…64780788230077391361
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.480 × 10⁹⁵(96-digit number)
24801972405548825738…64780788230077391361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.960 × 10⁹⁵(96-digit number)
49603944811097651476…29561576460154782721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.920 × 10⁹⁵(96-digit number)
99207889622195302953…59123152920309565441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.984 × 10⁹⁶(97-digit number)
19841577924439060590…18246305840619130881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.968 × 10⁹⁶(97-digit number)
39683155848878121181…36492611681238261761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.936 × 10⁹⁶(97-digit number)
79366311697756242362…72985223362476523521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.587 × 10⁹⁷(98-digit number)
15873262339551248472…45970446724953047041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.174 × 10⁹⁷(98-digit number)
31746524679102496945…91940893449906094081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.349 × 10⁹⁷(98-digit number)
63493049358204993890…83881786899812188161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.269 × 10⁹⁸(99-digit number)
12698609871640998778…67763573799624376321
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,976,435 XPM·at block #6,841,506 · 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