Block #2,128,185

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/22/2017, 2:02:09 PM · Difficulty 10.9167 · 4,696,644 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f3366c1f91c9aded91dfeda20f2e274ce8ca92c19e2b91271cc6f49c4dcff80e

Height

#2,128,185

Difficulty

10.916743

Transactions

4

Size

23.55 KB

Version

2

Bits

0aeaafae

Nonce

2,063,788,438

Timestamp

5/22/2017, 2:02:09 PM

Confirmations

4,696,644

Merkle Root

f807153e0fd0e8dc14546f46cd78c85df6deac3b1fb49816d33eed11e43d609d
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.

3.748 × 10⁹⁴(95-digit number)
37489105221252218213…19911606650707095561
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
3.748 × 10⁹⁴(95-digit number)
37489105221252218213…19911606650707095561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.497 × 10⁹⁴(95-digit number)
74978210442504436426…39823213301414191121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.499 × 10⁹⁵(96-digit number)
14995642088500887285…79646426602828382241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.999 × 10⁹⁵(96-digit number)
29991284177001774570…59292853205656764481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.998 × 10⁹⁵(96-digit number)
59982568354003549141…18585706411313528961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.199 × 10⁹⁶(97-digit number)
11996513670800709828…37171412822627057921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.399 × 10⁹⁶(97-digit number)
23993027341601419656…74342825645254115841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.798 × 10⁹⁶(97-digit number)
47986054683202839313…48685651290508231681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.597 × 10⁹⁶(97-digit number)
95972109366405678626…97371302581016463361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.919 × 10⁹⁷(98-digit number)
19194421873281135725…94742605162032926721
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,711 XPM·at block #6,824,828 · 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