Block #856,583

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2014, 4:36:27 AM · Difficulty 10.9681 · 5,952,839 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
305b73760ff5eeccd6bc8a5c2f26166cd284e043165330c9dbd3992486b46336

Height

#856,583

Difficulty

10.968053

Transactions

4

Size

886 B

Version

2

Bits

0af7d256

Nonce

922,905,945

Timestamp

12/17/2014, 4:36:27 AM

Confirmations

5,952,839

Merkle Root

464f8b8e301d032993e0719197dfc623902867daf9222603c156b115bf05abcf
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.390 × 10⁹⁶(97-digit number)
13909640546829262252…52407546496473410321
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.390 × 10⁹⁶(97-digit number)
13909640546829262252…52407546496473410321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.781 × 10⁹⁶(97-digit number)
27819281093658524504…04815092992946820641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.563 × 10⁹⁶(97-digit number)
55638562187317049008…09630185985893641281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.112 × 10⁹⁷(98-digit number)
11127712437463409801…19260371971787282561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.225 × 10⁹⁷(98-digit number)
22255424874926819603…38520743943574565121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.451 × 10⁹⁷(98-digit number)
44510849749853639207…77041487887149130241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.902 × 10⁹⁷(98-digit number)
89021699499707278414…54082975774298260481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.780 × 10⁹⁸(99-digit number)
17804339899941455682…08165951548596520961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.560 × 10⁹⁸(99-digit number)
35608679799882911365…16331903097193041921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.121 × 10⁹⁸(99-digit number)
71217359599765822731…32663806194386083841
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,719,445 XPM·at block #6,809,421 · 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