Block #2,997,461

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/6/2019, 2:19:14 AM · Difficulty 11.2508 · 3,833,641 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
855bfdda895c8095179ae83ceb1b2044b88bd9858206fba90cd570e7b4efc20d

Height

#2,997,461

Difficulty

11.250795

Transactions

8

Size

2.61 KB

Version

2

Bits

0b403413

Nonce

613,478,936

Timestamp

1/6/2019, 2:19:14 AM

Confirmations

3,833,641

Merkle Root

5ad4e6d41df0bf8bb68250507286ffd3d5533715362ef1e6bb128b4b66056296
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.450 × 10⁹⁴(95-digit number)
24506941001191697725…69962192223984092161
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.450 × 10⁹⁴(95-digit number)
24506941001191697725…69962192223984092161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.901 × 10⁹⁴(95-digit number)
49013882002383395451…39924384447968184321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.802 × 10⁹⁴(95-digit number)
98027764004766790902…79848768895936368641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.960 × 10⁹⁵(96-digit number)
19605552800953358180…59697537791872737281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.921 × 10⁹⁵(96-digit number)
39211105601906716360…19395075583745474561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.842 × 10⁹⁵(96-digit number)
78422211203813432721…38790151167490949121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.568 × 10⁹⁶(97-digit number)
15684442240762686544…77580302334981898241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.136 × 10⁹⁶(97-digit number)
31368884481525373088…55160604669963796481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.273 × 10⁹⁶(97-digit number)
62737768963050746177…10321209339927592961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.254 × 10⁹⁷(98-digit number)
12547553792610149235…20642418679855185921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.509 × 10⁹⁷(98-digit number)
25095107585220298470…41284837359710371841
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,892,959 XPM·at block #6,831,101 · 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