Block #850,711

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/12/2014, 5:34:27 PM · Difficulty 10.9712 · 5,955,749 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f5bf6ab429a4a5b7b1999bebfae872eb554ff380d8b9f7ed438d739827b4af08

Height

#850,711

Difficulty

10.971187

Transactions

7

Size

2.97 KB

Version

2

Bits

0af89fbd

Nonce

1,395,140,758

Timestamp

12/12/2014, 5:34:27 PM

Confirmations

5,955,749

Merkle Root

d0cccc351f778393502aac97ca4ecf53b827c4fb91a8dacfb445864a9c4d5593
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.226 × 10⁹⁷(98-digit number)
12267792262882801507…19639070434560788481
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.226 × 10⁹⁷(98-digit number)
12267792262882801507…19639070434560788481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.453 × 10⁹⁷(98-digit number)
24535584525765603014…39278140869121576961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.907 × 10⁹⁷(98-digit number)
49071169051531206028…78556281738243153921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.814 × 10⁹⁷(98-digit number)
98142338103062412057…57112563476486307841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.962 × 10⁹⁸(99-digit number)
19628467620612482411…14225126952972615681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.925 × 10⁹⁸(99-digit number)
39256935241224964823…28450253905945231361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.851 × 10⁹⁸(99-digit number)
78513870482449929646…56900507811890462721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.570 × 10⁹⁹(100-digit number)
15702774096489985929…13801015623780925441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.140 × 10⁹⁹(100-digit number)
31405548192979971858…27602031247561850881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.281 × 10⁹⁹(100-digit number)
62811096385959943716…55204062495123701761
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,695,772 XPM·at block #6,806,459 · 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