Block #2,811,556

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/27/2018, 2:10:28 AM · Difficulty 11.6683 · 4,033,570 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
68d1f9671010d05df8a6da4e19464d78dcfd0b81b32e07bf9b88b3b0d8b82ca3

Height

#2,811,556

Difficulty

11.668306

Transactions

10

Size

3.28 KB

Version

2

Bits

0bab1615

Nonce

1,690,245,887

Timestamp

8/27/2018, 2:10:28 AM

Confirmations

4,033,570

Merkle Root

6ce04aab77decd7f4d76a2918cb295c0fefced1d119b954345c5cb0b21bbd737
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.110 × 10⁹⁸(99-digit number)
11106250891212824028…46093198302153605121
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.110 × 10⁹⁸(99-digit number)
11106250891212824028…46093198302153605121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.221 × 10⁹⁸(99-digit number)
22212501782425648056…92186396604307210241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.442 × 10⁹⁸(99-digit number)
44425003564851296112…84372793208614420481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.885 × 10⁹⁸(99-digit number)
88850007129702592225…68745586417228840961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.777 × 10⁹⁹(100-digit number)
17770001425940518445…37491172834457681921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.554 × 10⁹⁹(100-digit number)
35540002851881036890…74982345668915363841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.108 × 10⁹⁹(100-digit number)
71080005703762073780…49964691337830727681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.421 × 10¹⁰⁰(101-digit number)
14216001140752414756…99929382675661455361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.843 × 10¹⁰⁰(101-digit number)
28432002281504829512…99858765351322910721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.686 × 10¹⁰⁰(101-digit number)
56864004563009659024…99717530702645821441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.137 × 10¹⁰¹(102-digit number)
11372800912601931804…99435061405291642881
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:58,005,435 XPM·at block #6,845,125 · 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