Block #2,111,016

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/11/2017, 3:45:31 AM · Difficulty 10.9035 · 4,729,060 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
511d5c39b56797199fff571b201c64f315cae2dbcd256499967ec3989b20ba0f

Height

#2,111,016

Difficulty

10.903523

Transactions

45

Size

13.93 KB

Version

2

Bits

0ae74d50

Nonce

1,312,378,533

Timestamp

5/11/2017, 3:45:31 AM

Confirmations

4,729,060

Merkle Root

387dd78e995088bc9a83218ddf6fd95a5fa8fb5d9e3bd46370f3513e0d0e4cca
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.

1.278 × 10⁹⁴(95-digit number)
12789141752521332436…81577674363899589961
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
1.278 × 10⁹⁴(95-digit number)
12789141752521332436…81577674363899589961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.557 × 10⁹⁴(95-digit number)
25578283505042664873…63155348727799179921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.115 × 10⁹⁴(95-digit number)
51156567010085329746…26310697455598359841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.023 × 10⁹⁵(96-digit number)
10231313402017065949…52621394911196719681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.046 × 10⁹⁵(96-digit number)
20462626804034131898…05242789822393439361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.092 × 10⁹⁵(96-digit number)
40925253608068263797…10485579644786878721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.185 × 10⁹⁵(96-digit number)
81850507216136527595…20971159289573757441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.637 × 10⁹⁶(97-digit number)
16370101443227305519…41942318579147514881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.274 × 10⁹⁶(97-digit number)
32740202886454611038…83884637158295029761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.548 × 10⁹⁶(97-digit number)
65480405772909222076…67769274316590059521
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,964,915 XPM·at block #6,840,075 · 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