Block #857,451

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2014, 8:32:22 PM · Difficulty 10.9675 · 5,983,573 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c7fa6cceb39ea58c8f100a9391cc808f7434ca03c910926454f851e31e7a7cc6

Height

#857,451

Difficulty

10.967518

Transactions

2

Size

424 B

Version

2

Bits

0af7af41

Nonce

454,983,299

Timestamp

12/17/2014, 8:32:22 PM

Confirmations

5,983,573

Merkle Root

1a0101ff6268ed0cf7f952c3fddad9f11f79715b0136420e6709875de868eeac
Transactions (2)
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.147 × 10⁹⁴(95-digit number)
11479879557723836086…83231665351699701121
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.147 × 10⁹⁴(95-digit number)
11479879557723836086…83231665351699701121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.295 × 10⁹⁴(95-digit number)
22959759115447672173…66463330703399402241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.591 × 10⁹⁴(95-digit number)
45919518230895344346…32926661406798804481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.183 × 10⁹⁴(95-digit number)
91839036461790688693…65853322813597608961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.836 × 10⁹⁵(96-digit number)
18367807292358137738…31706645627195217921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.673 × 10⁹⁵(96-digit number)
36735614584716275477…63413291254390435841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.347 × 10⁹⁵(96-digit number)
73471229169432550954…26826582508780871681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.469 × 10⁹⁶(97-digit number)
14694245833886510190…53653165017561743361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.938 × 10⁹⁶(97-digit number)
29388491667773020381…07306330035123486721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.877 × 10⁹⁶(97-digit number)
58776983335546040763…14612660070246973441
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,972,541 XPM·at block #6,841,022 · 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