Block #1,985,803

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/16/2017, 2:20:52 PM · Difficulty 10.7374 · 4,854,712 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f9cc583bc5cc697630375e3430687b1b3f8499b0e8f416b1559646c73da52c01

Height

#1,985,803

Difficulty

10.737440

Transactions

2

Size

871 B

Version

2

Bits

0abcc8e1

Nonce

417,569,614

Timestamp

2/16/2017, 2:20:52 PM

Confirmations

4,854,712

Merkle Root

0dde7fe948b331f1a2b2ca6236fb65cd99b102f53382fbb854492c7ba4f4817e
Transactions (2)
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.

6.135 × 10⁹⁴(95-digit number)
61357952860133305882…09337500398982917281
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
6.135 × 10⁹⁴(95-digit number)
61357952860133305882…09337500398982917281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.227 × 10⁹⁵(96-digit number)
12271590572026661176…18675000797965834561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.454 × 10⁹⁵(96-digit number)
24543181144053322353…37350001595931669121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.908 × 10⁹⁵(96-digit number)
49086362288106644706…74700003191863338241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.817 × 10⁹⁵(96-digit number)
98172724576213289412…49400006383726676481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.963 × 10⁹⁶(97-digit number)
19634544915242657882…98800012767453352961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.926 × 10⁹⁶(97-digit number)
39269089830485315765…97600025534906705921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.853 × 10⁹⁶(97-digit number)
78538179660970631530…95200051069813411841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.570 × 10⁹⁷(98-digit number)
15707635932194126306…90400102139626823681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.141 × 10⁹⁷(98-digit number)
31415271864388252612…80800204279253647361
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,968,448 XPM·at block #6,840,514 · 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