Block #856,158

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2014, 9:06:53 PM · Difficulty 10.9682 · 5,961,308 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6bee1322cbe861c680b8ab3df018f84b4f3a74d7a5de2376aba26a8c5d053442

Height

#856,158

Difficulty

10.968209

Transactions

3

Size

951 B

Version

2

Bits

0af7dc88

Nonce

1,110,652,928

Timestamp

12/16/2014, 9:06:53 PM

Confirmations

5,961,308

Merkle Root

932b99cb182ed35c86137bcbee7544ee89ef60b6f8002da754d629a58e3b151f
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.

9.806 × 10⁹⁵(96-digit number)
98067118762339855923…74403158036160519681
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
9.806 × 10⁹⁵(96-digit number)
98067118762339855923…74403158036160519681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.961 × 10⁹⁶(97-digit number)
19613423752467971184…48806316072321039361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.922 × 10⁹⁶(97-digit number)
39226847504935942369…97612632144642078721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.845 × 10⁹⁶(97-digit number)
78453695009871884738…95225264289284157441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.569 × 10⁹⁷(98-digit number)
15690739001974376947…90450528578568314881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.138 × 10⁹⁷(98-digit number)
31381478003948753895…80901057157136629761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.276 × 10⁹⁷(98-digit number)
62762956007897507791…61802114314273259521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.255 × 10⁹⁸(99-digit number)
12552591201579501558…23604228628546519041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.510 × 10⁹⁸(99-digit number)
25105182403159003116…47208457257093038081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.021 × 10⁹⁸(99-digit number)
50210364806318006232…94416914514186076161
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,783,779 XPM·at block #6,817,465 · 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