Block #858,013

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2014, 6:47:49 AM · Difficulty 10.9672 · 5,982,609 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
940e44e5732100e2bc6031d862d50510a242e33b24ebe2abf7aeaaa4bc62376d

Height

#858,013

Difficulty

10.967189

Transactions

14

Size

3.95 KB

Version

2

Bits

0af799b7

Nonce

2,919,795,360

Timestamp

12/18/2014, 6:47:49 AM

Confirmations

5,982,609

Merkle Root

8c642e794f8b123cd7471a481e4ee29243edf4c4adbcb26f6c7de79a80f7dc64
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.609 × 10⁹³(94-digit number)
66097608212220153724…12363148922876318081
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.609 × 10⁹³(94-digit number)
66097608212220153724…12363148922876318081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.321 × 10⁹⁴(95-digit number)
13219521642444030744…24726297845752636161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.643 × 10⁹⁴(95-digit number)
26439043284888061489…49452595691505272321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.287 × 10⁹⁴(95-digit number)
52878086569776122979…98905191383010544641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.057 × 10⁹⁵(96-digit number)
10575617313955224595…97810382766021089281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.115 × 10⁹⁵(96-digit number)
21151234627910449191…95620765532042178561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.230 × 10⁹⁵(96-digit number)
42302469255820898383…91241531064084357121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.460 × 10⁹⁵(96-digit number)
84604938511641796767…82483062128168714241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.692 × 10⁹⁶(97-digit number)
16920987702328359353…64966124256337428481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.384 × 10⁹⁶(97-digit number)
33841975404656718707…29932248512674856961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.768 × 10⁹⁶(97-digit number)
67683950809313437414…59864497025349713921
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,969,315 XPM·at block #6,840,621 · 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