Block #858,545

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2014, 5:19:00 PM · Difficulty 10.9666 · 5,972,502 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
81c19972c0dcdc66d0d1886af64ed0cdc86030e5a1337c5a6d88d4958ba87888

Height

#858,545

Difficulty

10.966553

Transactions

16

Size

3.95 KB

Version

2

Bits

0af77003

Nonce

659,812,060

Timestamp

12/18/2014, 5:19:00 PM

Confirmations

5,972,502

Merkle Root

9134d7a597e3c128f2f6486d78a993a423b2ac3a45d9897436a3e1b5c238e537
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.

6.524 × 10⁹⁴(95-digit number)
65242851959772286283…86321637771347037191
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
6.524 × 10⁹⁴(95-digit number)
65242851959772286283…86321637771347037191
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.304 × 10⁹⁵(96-digit number)
13048570391954457256…72643275542694074381
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.609 × 10⁹⁵(96-digit number)
26097140783908914513…45286551085388148761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.219 × 10⁹⁵(96-digit number)
52194281567817829026…90573102170776297521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.043 × 10⁹⁶(97-digit number)
10438856313563565805…81146204341552595041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.087 × 10⁹⁶(97-digit number)
20877712627127131610…62292408683105190081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.175 × 10⁹⁶(97-digit number)
41755425254254263221…24584817366210380161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.351 × 10⁹⁶(97-digit number)
83510850508508526442…49169634732420760321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.670 × 10⁹⁷(98-digit number)
16702170101701705288…98339269464841520641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.340 × 10⁹⁷(98-digit number)
33404340203403410576…96678538929683041281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.680 × 10⁹⁷(98-digit number)
66808680406806821153…93357077859366082561
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,892,512 XPM·at block #6,831,046 · 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