Block #2,821,686

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/2/2018, 5:46:25 PM · Difficulty 11.7028 · 4,020,329 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d9a56eaec47d148e35f71d68c00a2041915ebba98dcd63b97b7f5926e09dd749

Height

#2,821,686

Difficulty

11.702850

Transactions

9

Size

3.57 KB

Version

2

Bits

0bb3edfa

Nonce

24,077,227

Timestamp

9/2/2018, 5:46:25 PM

Confirmations

4,020,329

Merkle Root

f5f2aeab1a2cc9dd58ab6a211306805d0f9a53ea23014eb38c13a7a2dccc7750
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.

9.291 × 10⁹⁶(97-digit number)
92916432584015142859…22204086103461765121
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
9.291 × 10⁹⁶(97-digit number)
92916432584015142859…22204086103461765121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.858 × 10⁹⁷(98-digit number)
18583286516803028571…44408172206923530241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.716 × 10⁹⁷(98-digit number)
37166573033606057143…88816344413847060481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.433 × 10⁹⁷(98-digit number)
74333146067212114287…77632688827694120961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.486 × 10⁹⁸(99-digit number)
14866629213442422857…55265377655388241921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.973 × 10⁹⁸(99-digit number)
29733258426884845714…10530755310776483841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.946 × 10⁹⁸(99-digit number)
59466516853769691429…21061510621552967681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.189 × 10⁹⁹(100-digit number)
11893303370753938285…42123021243105935361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.378 × 10⁹⁹(100-digit number)
23786606741507876571…84246042486211870721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.757 × 10⁹⁹(100-digit number)
47573213483015753143…68492084972423741441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.514 × 10⁹⁹(100-digit number)
95146426966031506287…36984169944847482881
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,980,506 XPM·at block #6,842,014 · 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