Block #2,159,871

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/14/2017, 3:59:26 AM · Difficulty 10.9027 · 4,664,875 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
80d3237634f44c6b51313057e96e69aeabb13329da184e73d3e45f99393a41c0

Height

#2,159,871

Difficulty

10.902710

Transactions

17

Size

8.25 KB

Version

2

Bits

0ae71808

Nonce

637,429,605

Timestamp

6/14/2017, 3:59:26 AM

Confirmations

4,664,875

Merkle Root

140d4797e6c6e010d5c85eccbdac9ddcb7b41e8b4ffed2f09dd3987e8fbf1575
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.178 × 10⁹⁵(96-digit number)
11788322239812259620…05784656325084539681
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.178 × 10⁹⁵(96-digit number)
11788322239812259620…05784656325084539681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.357 × 10⁹⁵(96-digit number)
23576644479624519241…11569312650169079361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.715 × 10⁹⁵(96-digit number)
47153288959249038483…23138625300338158721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.430 × 10⁹⁵(96-digit number)
94306577918498076967…46277250600676317441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.886 × 10⁹⁶(97-digit number)
18861315583699615393…92554501201352634881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.772 × 10⁹⁶(97-digit number)
37722631167399230786…85109002402705269761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.544 × 10⁹⁶(97-digit number)
75445262334798461573…70218004805410539521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.508 × 10⁹⁷(98-digit number)
15089052466959692314…40436009610821079041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.017 × 10⁹⁷(98-digit number)
30178104933919384629…80872019221642158081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.035 × 10⁹⁷(98-digit number)
60356209867838769259…61744038443284316161
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,842,039 XPM·at block #6,824,745 · 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