Block #3,006,951

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/12/2019, 9:56:02 PM · Difficulty 11.2009 · 3,837,050 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
49ef2db137c0bb487a64033a47d59ac10979fac43382507ba55a3f7553536981

Height

#3,006,951

Difficulty

11.200859

Transactions

11

Size

4.04 KB

Version

2

Bits

0b336b81

Nonce

817,882,745

Timestamp

1/12/2019, 9:56:02 PM

Confirmations

3,837,050

Merkle Root

73212c9056837649c103607fafa08fe809d81d883d676acb0bc8a17c35a1b5d7
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.

5.337 × 10⁹⁴(95-digit number)
53377628340313421054…52615457809508366361
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
5.337 × 10⁹⁴(95-digit number)
53377628340313421054…52615457809508366361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.067 × 10⁹⁵(96-digit number)
10675525668062684210…05230915619016732721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.135 × 10⁹⁵(96-digit number)
21351051336125368421…10461831238033465441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.270 × 10⁹⁵(96-digit number)
42702102672250736843…20923662476066930881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.540 × 10⁹⁵(96-digit number)
85404205344501473686…41847324952133861761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.708 × 10⁹⁶(97-digit number)
17080841068900294737…83694649904267723521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.416 × 10⁹⁶(97-digit number)
34161682137800589474…67389299808535447041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.832 × 10⁹⁶(97-digit number)
68323364275601178949…34778599617070894081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.366 × 10⁹⁷(98-digit number)
13664672855120235789…69557199234141788161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.732 × 10⁹⁷(98-digit number)
27329345710240471579…39114398468283576321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.465 × 10⁹⁷(98-digit number)
54658691420480943159…78228796936567152641
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,996,390 XPM·at block #6,844,000 · 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