Block #859,081

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/19/2014, 3:58:08 AM · Difficulty 10.9659 · 5,967,930 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
62be97b671f62f104e0083bb4baae51b3d372f2624d98f2cfdc5535099a4f0aa

Height

#859,081

Difficulty

10.965901

Transactions

1

Size

662 B

Version

2

Bits

0af74542

Nonce

708,570

Timestamp

12/19/2014, 3:58:08 AM

Confirmations

5,967,930

Merkle Root

7454f46e26c071206ce1d0227b1cd4f3961fee3ad67a5c3edc3464608bdadd61
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.

5.507 × 10⁹²(93-digit number)
55076828732795222072…93906285249293853281
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
5.507 × 10⁹²(93-digit number)
55076828732795222072…93906285249293853281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.101 × 10⁹³(94-digit number)
11015365746559044414…87812570498587706561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.203 × 10⁹³(94-digit number)
22030731493118088829…75625140997175413121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.406 × 10⁹³(94-digit number)
44061462986236177658…51250281994350826241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.812 × 10⁹³(94-digit number)
88122925972472355316…02500563988701652481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.762 × 10⁹⁴(95-digit number)
17624585194494471063…05001127977403304961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.524 × 10⁹⁴(95-digit number)
35249170388988942126…10002255954806609921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.049 × 10⁹⁴(95-digit number)
70498340777977884252…20004511909613219841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.409 × 10⁹⁵(96-digit number)
14099668155595576850…40009023819226439681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.819 × 10⁹⁵(96-digit number)
28199336311191153701…80018047638452879361
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,860,265 XPM·at block #6,827,010 · 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