Block #2,138,067

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/30/2017, 1:28:14 PM · Difficulty 10.8859 · 4,704,187 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6f8ba82db5332be239d3cec5dc2d111ffa71c29039ff396aec63e76eb30613ca

Height

#2,138,067

Difficulty

10.885851

Transactions

2

Size

424 B

Version

2

Bits

0ae2c71f

Nonce

1,055,577,293

Timestamp

5/30/2017, 1:28:14 PM

Confirmations

4,704,187

Merkle Root

f6a797ea4782b3d5844092f2ecb0f6300899d132d493b35676e6d52dc5a010c0
Transactions (2)
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.428 × 10⁹³(94-digit number)
34285478784514162871…35148582233165250561
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.428 × 10⁹³(94-digit number)
34285478784514162871…35148582233165250561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.857 × 10⁹³(94-digit number)
68570957569028325742…70297164466330501121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.371 × 10⁹⁴(95-digit number)
13714191513805665148…40594328932661002241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.742 × 10⁹⁴(95-digit number)
27428383027611330297…81188657865322004481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.485 × 10⁹⁴(95-digit number)
54856766055222660594…62377315730644008961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.097 × 10⁹⁵(96-digit number)
10971353211044532118…24754631461288017921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.194 × 10⁹⁵(96-digit number)
21942706422089064237…49509262922576035841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.388 × 10⁹⁵(96-digit number)
43885412844178128475…99018525845152071681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.777 × 10⁹⁵(96-digit number)
87770825688356256950…98037051690304143361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.755 × 10⁹⁶(97-digit number)
17554165137671251390…96074103380608286721
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,982,429 XPM·at block #6,842,253 · 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