Block #857,160

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2014, 3:18:21 PM · Difficulty 10.9677 · 5,976,475 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
792f7740d9b3d3364ea1ec8d4b771f9a848bc145128a3216a2de5d74116019c8

Height

#857,160

Difficulty

10.967658

Transactions

3

Size

651 B

Version

2

Bits

0af7b874

Nonce

750,957,038

Timestamp

12/17/2014, 3:18:21 PM

Confirmations

5,976,475

Merkle Root

e3e81d3b5812930a706fdbc67ccd98afba4d8a017f73bb16b50fa260d92b90f3
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.

4.504 × 10⁹³(94-digit number)
45041745677599206243…71116289496429546081
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
4.504 × 10⁹³(94-digit number)
45041745677599206243…71116289496429546081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.008 × 10⁹³(94-digit number)
90083491355198412487…42232578992859092161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.801 × 10⁹⁴(95-digit number)
18016698271039682497…84465157985718184321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.603 × 10⁹⁴(95-digit number)
36033396542079364995…68930315971436368641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.206 × 10⁹⁴(95-digit number)
72066793084158729990…37860631942872737281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.441 × 10⁹⁵(96-digit number)
14413358616831745998…75721263885745474561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.882 × 10⁹⁵(96-digit number)
28826717233663491996…51442527771490949121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.765 × 10⁹⁵(96-digit number)
57653434467326983992…02885055542981898241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.153 × 10⁹⁶(97-digit number)
11530686893465396798…05770111085963796481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.306 × 10⁹⁶(97-digit number)
23061373786930793596…11540222171927592961
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,913,292 XPM·at block #6,833,634 · 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