Block #2,806,481

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/23/2018, 1:04:26 PM · Difficulty 11.6699 · 4,036,246 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d333e857201c7d5604895f7d8dfc1f83542d1ad200121d41383780de3062be84

Height

#2,806,481

Difficulty

11.669892

Transactions

25

Size

7.97 KB

Version

2

Bits

0bab7e11

Nonce

42,744,222

Timestamp

8/23/2018, 1:04:26 PM

Confirmations

4,036,246

Merkle Root

364691aa0cc1c681e4552cc73bdc587cc499cf0effb5091477cae232e11037cf
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.

4.409 × 10⁹⁷(98-digit number)
44093899613779383576…96457570651907840001
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
4.409 × 10⁹⁷(98-digit number)
44093899613779383576…96457570651907840001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.818 × 10⁹⁷(98-digit number)
88187799227558767153…92915141303815680001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.763 × 10⁹⁸(99-digit number)
17637559845511753430…85830282607631360001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.527 × 10⁹⁸(99-digit number)
35275119691023506861…71660565215262720001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.055 × 10⁹⁸(99-digit number)
70550239382047013722…43321130430525440001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.411 × 10⁹⁹(100-digit number)
14110047876409402744…86642260861050880001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.822 × 10⁹⁹(100-digit number)
28220095752818805489…73284521722101760001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.644 × 10⁹⁹(100-digit number)
56440191505637610978…46569043444203520001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.128 × 10¹⁰⁰(101-digit number)
11288038301127522195…93138086888407040001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.257 × 10¹⁰⁰(101-digit number)
22576076602255044391…86276173776814080001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.515 × 10¹⁰⁰(101-digit number)
45152153204510088782…72552347553628160001
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,986,155 XPM·at block #6,842,726 · 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