Block #859,507

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/19/2014, 12:51:31 PM · Difficulty 10.9652 · 5,950,653 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
77e778419966c4a86f1a9c3062c6dbff864b88a5ba0c7080e2e40aaa387b82a5

Height

#859,507

Difficulty

10.965165

Transactions

17

Size

3.85 KB

Version

2

Bits

0af7150f

Nonce

413,222,575

Timestamp

12/19/2014, 12:51:31 PM

Confirmations

5,950,653

Merkle Root

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

9.983 × 10⁹⁵(96-digit number)
99836252681569096486…36877311045469940801
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
9.983 × 10⁹⁵(96-digit number)
99836252681569096486…36877311045469940801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.996 × 10⁹⁶(97-digit number)
19967250536313819297…73754622090939881601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.993 × 10⁹⁶(97-digit number)
39934501072627638594…47509244181879763201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.986 × 10⁹⁶(97-digit number)
79869002145255277189…95018488363759526401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.597 × 10⁹⁷(98-digit number)
15973800429051055437…90036976727519052801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.194 × 10⁹⁷(98-digit number)
31947600858102110875…80073953455038105601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.389 × 10⁹⁷(98-digit number)
63895201716204221751…60147906910076211201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.277 × 10⁹⁸(99-digit number)
12779040343240844350…20295813820152422401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.555 × 10⁹⁸(99-digit number)
25558080686481688700…40591627640304844801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.111 × 10⁹⁸(99-digit number)
51116161372963377401…81183255280609689601
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,725,347 XPM·at block #6,810,159 · 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