Block #2,984,501

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/27/2018, 9:54:39 PM · Difficulty 11.2887 · 3,842,686 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e6502b4687de879eae1a69d48dd30adca52aa864a07faadee7bf8438804a93b9

Height

#2,984,501

Difficulty

11.288684

Transactions

5

Size

2.46 KB

Version

2

Bits

0b49e733

Nonce

389,853,837

Timestamp

12/27/2018, 9:54:39 PM

Confirmations

3,842,686

Merkle Root

6e16b8d45a96b993fcebaddfbd18022359b7595aeba546fee7efa40f2f27e332
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.

9.455 × 10⁹⁴(95-digit number)
94551919762329607345…45308044436838247041
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
9.455 × 10⁹⁴(95-digit number)
94551919762329607345…45308044436838247041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.891 × 10⁹⁵(96-digit number)
18910383952465921469…90616088873676494081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.782 × 10⁹⁵(96-digit number)
37820767904931842938…81232177747352988161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.564 × 10⁹⁵(96-digit number)
75641535809863685876…62464355494705976321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.512 × 10⁹⁶(97-digit number)
15128307161972737175…24928710989411952641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.025 × 10⁹⁶(97-digit number)
30256614323945474350…49857421978823905281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.051 × 10⁹⁶(97-digit number)
60513228647890948700…99714843957647810561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.210 × 10⁹⁷(98-digit number)
12102645729578189740…99429687915295621121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.420 × 10⁹⁷(98-digit number)
24205291459156379480…98859375830591242241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.841 × 10⁹⁷(98-digit number)
48410582918312758960…97718751661182484481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.682 × 10⁹⁷(98-digit number)
96821165836625517921…95437503322364968961
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,861,593 XPM·at block #6,827,186 · 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