Block #3,048,875

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/11/2019, 9:24:46 PM · Difficulty 10.9961 · 3,793,972 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
044e7dd3465b75d30fe58986d82ab0272a8868029984316c37ee9927d2e16266

Height

#3,048,875

Difficulty

10.996087

Transactions

13

Size

4.23 KB

Version

2

Bits

0afeff94

Nonce

994,854,526

Timestamp

2/11/2019, 9:24:46 PM

Confirmations

3,793,972

Merkle Root

dc6baaed798074d53dcc94cf9c7137697abf1a6e4f14e9f1b9f2f632c8db02fb
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.408 × 10⁹⁵(96-digit number)
24087138356088337986…18292724116920378601
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.408 × 10⁹⁵(96-digit number)
24087138356088337986…18292724116920378601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.817 × 10⁹⁵(96-digit number)
48174276712176675972…36585448233840757201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.634 × 10⁹⁵(96-digit number)
96348553424353351944…73170896467681514401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.926 × 10⁹⁶(97-digit number)
19269710684870670388…46341792935363028801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.853 × 10⁹⁶(97-digit number)
38539421369741340777…92683585870726057601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.707 × 10⁹⁶(97-digit number)
77078842739482681555…85367171741452115201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.541 × 10⁹⁷(98-digit number)
15415768547896536311…70734343482904230401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.083 × 10⁹⁷(98-digit number)
30831537095793072622…41468686965808460801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.166 × 10⁹⁷(98-digit number)
61663074191586145244…82937373931616921601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.233 × 10⁹⁸(99-digit number)
12332614838317229048…65874747863233843201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.466 × 10⁹⁸(99-digit number)
24665229676634458097…31749495726467686401
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,987,121 XPM·at block #6,842,846 · 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