Block #3,048,658

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/11/2019, 5:34:12 PM · Difficulty 10.9961 · 3,791,964 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
79d02419ed09b32dfaa2fe9debfec9d1917967baea6f6ed915926c0eb491180f

Height

#3,048,658

Difficulty

10.996092

Transactions

6

Size

1.34 KB

Version

2

Bits

0afeffdf

Nonce

1,418,366,350

Timestamp

2/11/2019, 5:34:12 PM

Confirmations

3,791,964

Merkle Root

c1fc485375c673e6a604e835285163a48347149a9ad4c5a4940730f27a20c5e4
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.436 × 10⁹⁷(98-digit number)
54368251169988903000…23109470350786718721
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.436 × 10⁹⁷(98-digit number)
54368251169988903000…23109470350786718721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.087 × 10⁹⁸(99-digit number)
10873650233997780600…46218940701573437441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.174 × 10⁹⁸(99-digit number)
21747300467995561200…92437881403146874881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.349 × 10⁹⁸(99-digit number)
43494600935991122400…84875762806293749761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.698 × 10⁹⁸(99-digit number)
86989201871982244800…69751525612587499521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.739 × 10⁹⁹(100-digit number)
17397840374396448960…39503051225174999041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.479 × 10⁹⁹(100-digit number)
34795680748792897920…79006102450349998081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.959 × 10⁹⁹(100-digit number)
69591361497585795840…58012204900699996161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.391 × 10¹⁰⁰(101-digit number)
13918272299517159168…16024409801399992321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.783 × 10¹⁰⁰(101-digit number)
27836544599034318336…32048819602799984641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.567 × 10¹⁰⁰(101-digit number)
55673089198068636672…64097639205599969281
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,969,315 XPM·at block #6,840,621 · 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