Block #856,279

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2014, 11:09:40 PM · Difficulty 10.9682 · 5,952,712 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
435c66718bc75aca68e4c7351d9322b4f727ab52a4583f81b8de4e9209e56512

Height

#856,279

Difficulty

10.968197

Transactions

3

Size

1.04 KB

Version

2

Bits

0af7dbc5

Nonce

2,507,788,449

Timestamp

12/16/2014, 11:09:40 PM

Confirmations

5,952,712

Merkle Root

42d551bda66962658c53b2abaf31a9124303d44b0d93c82627dd2e703fdf31d9
Transactions (3)
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.382 × 10⁹⁶(97-digit number)
13825845634364617642…01973606690314025841
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.382 × 10⁹⁶(97-digit number)
13825845634364617642…01973606690314025841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.765 × 10⁹⁶(97-digit number)
27651691268729235284…03947213380628051681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.530 × 10⁹⁶(97-digit number)
55303382537458470569…07894426761256103361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.106 × 10⁹⁷(98-digit number)
11060676507491694113…15788853522512206721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.212 × 10⁹⁷(98-digit number)
22121353014983388227…31577707045024413441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.424 × 10⁹⁷(98-digit number)
44242706029966776455…63155414090048826881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.848 × 10⁹⁷(98-digit number)
88485412059933552911…26310828180097653761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.769 × 10⁹⁸(99-digit number)
17697082411986710582…52621656360195307521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.539 × 10⁹⁸(99-digit number)
35394164823973421164…05243312720390615041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.078 × 10⁹⁸(99-digit number)
70788329647946842328…10486625440781230081
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,715,986 XPM·at block #6,808,990 · 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.

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