Block #858,583

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2014, 5:59:15 PM · Difficulty 10.9665 · 5,952,063 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d598ac6dd49f64f9a0ef7d9189eea3356af66899d7731485b07229b166ad1de8

Height

#858,583

Difficulty

10.966543

Transactions

16

Size

4.02 KB

Version

2

Bits

0af76f5a

Nonce

309,775,264

Timestamp

12/18/2014, 5:59:15 PM

Confirmations

5,952,063

Merkle Root

514fd6d134768ab279562a250eaf624e03ebf8322e3d239ec60ad3df40c8fe06
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.588 × 10⁹³(94-digit number)
15888810875998041631…02817015924609011521
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.588 × 10⁹³(94-digit number)
15888810875998041631…02817015924609011521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.177 × 10⁹³(94-digit number)
31777621751996083262…05634031849218023041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.355 × 10⁹³(94-digit number)
63555243503992166525…11268063698436046081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.271 × 10⁹⁴(95-digit number)
12711048700798433305…22536127396872092161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.542 × 10⁹⁴(95-digit number)
25422097401596866610…45072254793744184321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.084 × 10⁹⁴(95-digit number)
50844194803193733220…90144509587488368641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.016 × 10⁹⁵(96-digit number)
10168838960638746644…80289019174976737281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.033 × 10⁹⁵(96-digit number)
20337677921277493288…60578038349953474561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.067 × 10⁹⁵(96-digit number)
40675355842554986576…21156076699906949121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.135 × 10⁹⁵(96-digit number)
81350711685109973152…42312153399813898241
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,729,257 XPM·at block #6,810,645 · 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