Block #2,801,987

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/20/2018, 9:46:31 AM · Difficulty 11.6713 · 4,037,619 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
158aa074421e2ab126612cad7f067ebc40b8ce1772dd1270d0685aa0a08edc19

Height

#2,801,987

Difficulty

11.671303

Transactions

21

Size

7.09 KB

Version

2

Bits

0babda8a

Nonce

599,315,850

Timestamp

8/20/2018, 9:46:31 AM

Confirmations

4,037,619

Merkle Root

eedd4ad70baceac657a236b79f65ab2b72b2fea39b0d405fa7113990a62c44ba
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.301 × 10⁹⁵(96-digit number)
23013016850089055910…15377186366879836161
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.301 × 10⁹⁵(96-digit number)
23013016850089055910…15377186366879836161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.602 × 10⁹⁵(96-digit number)
46026033700178111821…30754372733759672321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.205 × 10⁹⁵(96-digit number)
92052067400356223642…61508745467519344641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.841 × 10⁹⁶(97-digit number)
18410413480071244728…23017490935038689281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.682 × 10⁹⁶(97-digit number)
36820826960142489457…46034981870077378561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.364 × 10⁹⁶(97-digit number)
73641653920284978914…92069963740154757121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.472 × 10⁹⁷(98-digit number)
14728330784056995782…84139927480309514241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.945 × 10⁹⁷(98-digit number)
29456661568113991565…68279854960619028481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.891 × 10⁹⁷(98-digit number)
58913323136227983131…36559709921238056961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.178 × 10⁹⁸(99-digit number)
11782664627245596626…73119419842476113921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.356 × 10⁹⁸(99-digit number)
23565329254491193252…46238839684952227841
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,961,137 XPM·at block #6,839,605 · 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