Block #2,118,940

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/16/2017, 10:37:47 AM · Difficulty 10.9095 · 4,690,668 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
62715f9ffa6274f551766519ab339120d823e352cad6c75617f15692c1654067

Height

#2,118,940

Difficulty

10.909494

Transactions

1

Size

239 B

Version

2

Bits

0ae8d494

Nonce

102,551

Timestamp

5/16/2017, 10:37:47 AM

Confirmations

4,690,668

Merkle Root

27e6955f8a5b09e7b4517a171adb8d099c983ccdcf088c5ca86482851c951c79
Transactions (1)
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.420 × 10¹⁰⁴(105-digit number)
34207643487705158439…76080513503386188801
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.420 × 10¹⁰⁴(105-digit number)
34207643487705158439…76080513503386188801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.841 × 10¹⁰⁴(105-digit number)
68415286975410316879…52161027006772377601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.368 × 10¹⁰⁵(106-digit number)
13683057395082063375…04322054013544755201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.736 × 10¹⁰⁵(106-digit number)
27366114790164126751…08644108027089510401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.473 × 10¹⁰⁵(106-digit number)
54732229580328253503…17288216054179020801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.094 × 10¹⁰⁶(107-digit number)
10946445916065650700…34576432108358041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.189 × 10¹⁰⁶(107-digit number)
21892891832131301401…69152864216716083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.378 × 10¹⁰⁶(107-digit number)
43785783664262602802…38305728433432166401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.757 × 10¹⁰⁶(107-digit number)
87571567328525205605…76611456866864332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.751 × 10¹⁰⁷(108-digit number)
17514313465705041121…53222913733728665601
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,720,940 XPM·at block #6,809,607 · 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.

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