Block #2,165,320

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/18/2017, 2:43:48 AM · Difficulty 10.8982 · 4,659,181 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c59ac103ff3fbccbe3224bf5b773f03f3a14908fa680408e9118185e0de3871b

Height

#2,165,320

Difficulty

10.898221

Transactions

2

Size

2.94 KB

Version

2

Bits

0ae5f1d1

Nonce

81,424,696

Timestamp

6/18/2017, 2:43:48 AM

Confirmations

4,659,181

Merkle Root

b735d5d01bf23c551956854d54ad6841f42edb3d5cfc6666f8dd356891e6de3e
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.172 × 10⁹⁶(97-digit number)
21720238003562751629…16729826298606784001
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.172 × 10⁹⁶(97-digit number)
21720238003562751629…16729826298606784001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.344 × 10⁹⁶(97-digit number)
43440476007125503259…33459652597213568001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.688 × 10⁹⁶(97-digit number)
86880952014251006518…66919305194427136001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.737 × 10⁹⁷(98-digit number)
17376190402850201303…33838610388854272001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.475 × 10⁹⁷(98-digit number)
34752380805700402607…67677220777708544001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.950 × 10⁹⁷(98-digit number)
69504761611400805215…35354441555417088001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.390 × 10⁹⁸(99-digit number)
13900952322280161043…70708883110834176001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.780 × 10⁹⁸(99-digit number)
27801904644560322086…41417766221668352001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.560 × 10⁹⁸(99-digit number)
55603809289120644172…82835532443336704001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.112 × 10⁹⁹(100-digit number)
11120761857824128834…65671064886673408001
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,840,067 XPM·at block #6,824,500 · 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