Block #2,156,451

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/11/2017, 3:35:50 PM · Difficulty 10.9064 · 4,686,073 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4ba2434e517cef82ca86fad2bd61d1382cc938ef2ae1b0c0d8eacced9343bb7f

Height

#2,156,451

Difficulty

10.906449

Transactions

5

Size

1.08 KB

Version

2

Bits

0ae80d0e

Nonce

333,662,715

Timestamp

6/11/2017, 3:35:50 PM

Confirmations

4,686,073

Merkle Root

0bd536ea2728d87fcdcea99315a565aeed2ca949925e3391ee640c5d7318b446
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.259 × 10⁹⁴(95-digit number)
22594995022301904111…76267464638044656641
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.259 × 10⁹⁴(95-digit number)
22594995022301904111…76267464638044656641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.518 × 10⁹⁴(95-digit number)
45189990044603808223…52534929276089313281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.037 × 10⁹⁴(95-digit number)
90379980089207616447…05069858552178626561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.807 × 10⁹⁵(96-digit number)
18075996017841523289…10139717104357253121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.615 × 10⁹⁵(96-digit number)
36151992035683046578…20279434208714506241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.230 × 10⁹⁵(96-digit number)
72303984071366093157…40558868417429012481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.446 × 10⁹⁶(97-digit number)
14460796814273218631…81117736834858024961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.892 × 10⁹⁶(97-digit number)
28921593628546437263…62235473669716049921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.784 × 10⁹⁶(97-digit number)
57843187257092874526…24470947339432099841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.156 × 10⁹⁷(98-digit number)
11568637451418574905…48941894678864199681
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,984,613 XPM·at block #6,842,523 · 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