Block #2,163,786

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/17/2017, 12:02:50 AM · Difficulty 10.8995 · 4,670,174 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
005f8f1935e7759568ecc005c42971d8d20dcaedd9a9762dd39d0452aed11254

Height

#2,163,786

Difficulty

10.899507

Transactions

4

Size

2.42 KB

Version

2

Bits

0ae6461c

Nonce

219,267,447

Timestamp

6/17/2017, 12:02:50 AM

Confirmations

4,670,174

Merkle Root

8e33cb5c6cffe3c28bc06b6821decfe990aadc7c951be10dc11cfe0181a943c3
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.651 × 10⁹⁴(95-digit number)
26510168337240329123…08710818896817527641
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.651 × 10⁹⁴(95-digit number)
26510168337240329123…08710818896817527641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.302 × 10⁹⁴(95-digit number)
53020336674480658246…17421637793635055281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.060 × 10⁹⁵(96-digit number)
10604067334896131649…34843275587270110561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.120 × 10⁹⁵(96-digit number)
21208134669792263298…69686551174540221121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.241 × 10⁹⁵(96-digit number)
42416269339584526597…39373102349080442241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.483 × 10⁹⁵(96-digit number)
84832538679169053194…78746204698160884481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.696 × 10⁹⁶(97-digit number)
16966507735833810638…57492409396321768961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.393 × 10⁹⁶(97-digit number)
33933015471667621277…14984818792643537921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.786 × 10⁹⁶(97-digit number)
67866030943335242555…29969637585287075841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.357 × 10⁹⁷(98-digit number)
13573206188667048511…59939275170574151681
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,915,908 XPM·at block #6,833,959 · 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