Block #2,801,984

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/20/2018, 9:43:13 AM · Difficulty 11.6712 · 4,040,328 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7acb1565075e459c36c53a514f96c15ae48fb6ff35325a95f672794b1346a025

Height

#2,801,984

Difficulty

11.671224

Transactions

6

Size

2.10 KB

Version

2

Bits

0babd556

Nonce

141,071,920

Timestamp

8/20/2018, 9:43:13 AM

Confirmations

4,040,328

Merkle Root

a3ea1373c1c559c715798d5e70ee2ab3d0daf78ca6743d4e319ad5456ad28ed9
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.106 × 10⁹⁴(95-digit number)
41068752965858023529…92067013806879410191
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.106 × 10⁹⁴(95-digit number)
41068752965858023529…92067013806879410191
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.213 × 10⁹⁴(95-digit number)
82137505931716047058…84134027613758820381
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.642 × 10⁹⁵(96-digit number)
16427501186343209411…68268055227517640761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.285 × 10⁹⁵(96-digit number)
32855002372686418823…36536110455035281521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.571 × 10⁹⁵(96-digit number)
65710004745372837647…73072220910070563041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.314 × 10⁹⁶(97-digit number)
13142000949074567529…46144441820141126081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.628 × 10⁹⁶(97-digit number)
26284001898149135058…92288883640282252161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.256 × 10⁹⁶(97-digit number)
52568003796298270117…84577767280564504321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.051 × 10⁹⁷(98-digit number)
10513600759259654023…69155534561129008641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.102 × 10⁹⁷(98-digit number)
21027201518519308047…38311069122258017281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.205 × 10⁹⁷(98-digit number)
42054403037038616094…76622138244516034561
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,982,903 XPM·at block #6,842,311 · 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