Block #2,159,801

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/14/2017, 2:46:27 AM · Difficulty 10.9028 · 4,667,309 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
584651449102ea91142c80abaaf70f33e2778c16ce7a046d697af0b7b958ec03

Height

#2,159,801

Difficulty

10.902768

Transactions

4

Size

4.33 KB

Version

2

Bits

0ae71bc7

Nonce

1,204,628,110

Timestamp

6/14/2017, 2:46:27 AM

Confirmations

4,667,309

Merkle Root

ed1e6cf733189486621dc4bf1bb5bc1b6afd72e4bfdd8e947110f2f542b7bac3
Transactions (4)
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.

2.083 × 10⁹⁴(95-digit number)
20835746259442048083…01861751881152876481
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
2.083 × 10⁹⁴(95-digit number)
20835746259442048083…01861751881152876481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.167 × 10⁹⁴(95-digit number)
41671492518884096167…03723503762305752961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.334 × 10⁹⁴(95-digit number)
83342985037768192335…07447007524611505921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.666 × 10⁹⁵(96-digit number)
16668597007553638467…14894015049223011841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.333 × 10⁹⁵(96-digit number)
33337194015107276934…29788030098446023681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.667 × 10⁹⁵(96-digit number)
66674388030214553868…59576060196892047361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.333 × 10⁹⁶(97-digit number)
13334877606042910773…19152120393784094721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.666 × 10⁹⁶(97-digit number)
26669755212085821547…38304240787568189441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.333 × 10⁹⁶(97-digit number)
53339510424171643094…76608481575136378881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.066 × 10⁹⁷(98-digit number)
10667902084834328618…53216963150272757761
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,861,059 XPM·at block #6,827,109 · 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