Block #2,998,750

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/7/2019, 1:21:25 AM · Difficulty 11.2368 · 3,828,401 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a1200bbc5d635b8b7228aa8775f3ddbc739bca63dd650e4d4f2564d99ad718d6

Height

#2,998,750

Difficulty

11.236760

Transactions

2

Size

724 B

Version

2

Bits

0b3c9c50

Nonce

1,486,420,168

Timestamp

1/7/2019, 1:21:25 AM

Confirmations

3,828,401

Merkle Root

0aeef96316f76c2fa26903abd1b5157a90d82f01fab954f6f41b52780afcf3fb
Transactions (2)
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.

6.549 × 10⁹⁴(95-digit number)
65498218530461506433…79866275404381798321
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
6.549 × 10⁹⁴(95-digit number)
65498218530461506433…79866275404381798321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.309 × 10⁹⁵(96-digit number)
13099643706092301286…59732550808763596641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.619 × 10⁹⁵(96-digit number)
26199287412184602573…19465101617527193281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.239 × 10⁹⁵(96-digit number)
52398574824369205147…38930203235054386561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.047 × 10⁹⁶(97-digit number)
10479714964873841029…77860406470108773121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.095 × 10⁹⁶(97-digit number)
20959429929747682058…55720812940217546241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.191 × 10⁹⁶(97-digit number)
41918859859495364117…11441625880435092481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.383 × 10⁹⁶(97-digit number)
83837719718990728235…22883251760870184961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.676 × 10⁹⁷(98-digit number)
16767543943798145647…45766503521740369921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.353 × 10⁹⁷(98-digit number)
33535087887596291294…91533007043480739841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
6.707 × 10⁹⁷(98-digit number)
67070175775192582588…83066014086961479681
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,392 XPM·at block #6,827,150 · 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