Block #2,788,004

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/10/2018, 3:53:15 PM · Difficulty 11.6740 · 4,045,732 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9db7ec7675cb34f1a0501d5060b46fe4dcdc955b30d2e27a35808d77296428e7

Height

#2,788,004

Difficulty

11.673993

Transactions

2

Size

870 B

Version

2

Bits

0bac8ad4

Nonce

1,041,074,286

Timestamp

8/10/2018, 3:53:15 PM

Confirmations

4,045,732

Merkle Root

8019c4de1134f52af749636180387688f67632ef80598f266dc94d7c956c02ab
Transactions (2)
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.732 × 10⁹⁷(98-digit number)
27328565397402452558…05198442280854835201
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.732 × 10⁹⁷(98-digit number)
27328565397402452558…05198442280854835201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.465 × 10⁹⁷(98-digit number)
54657130794804905116…10396884561709670401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.093 × 10⁹⁸(99-digit number)
10931426158960981023…20793769123419340801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.186 × 10⁹⁸(99-digit number)
21862852317921962046…41587538246838681601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.372 × 10⁹⁸(99-digit number)
43725704635843924093…83175076493677363201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.745 × 10⁹⁸(99-digit number)
87451409271687848186…66350152987354726401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.749 × 10⁹⁹(100-digit number)
17490281854337569637…32700305974709452801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.498 × 10⁹⁹(100-digit number)
34980563708675139274…65400611949418905601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.996 × 10⁹⁹(100-digit number)
69961127417350278549…30801223898837811201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.399 × 10¹⁰⁰(101-digit number)
13992225483470055709…61602447797675622401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.798 × 10¹⁰⁰(101-digit number)
27984450966940111419…23204895595351244801
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,914,105 XPM·at block #6,833,735 · 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