Block #2,996,242

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/5/2019, 4:50:04 AM · Difficulty 11.2610 · 3,846,092 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4674552731567d7a4ccce2935afb0a28dbc3f78b89ef82fbc6620f08bc9f2025

Height

#2,996,242

Difficulty

11.261012

Transactions

13

Size

4.59 KB

Version

2

Bits

0b42d1b7

Nonce

1,862,742,221

Timestamp

1/5/2019, 4:50:04 AM

Confirmations

3,846,092

Merkle Root

967af16775b28f7d530905b3ea6b273e01ffe7168d8bec547d197cb964bc65c8
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.629 × 10⁹⁵(96-digit number)
26293392719216745687…35650932172385221121
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.629 × 10⁹⁵(96-digit number)
26293392719216745687…35650932172385221121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.258 × 10⁹⁵(96-digit number)
52586785438433491375…71301864344770442241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.051 × 10⁹⁶(97-digit number)
10517357087686698275…42603728689540884481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.103 × 10⁹⁶(97-digit number)
21034714175373396550…85207457379081768961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.206 × 10⁹⁶(97-digit number)
42069428350746793100…70414914758163537921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.413 × 10⁹⁶(97-digit number)
84138856701493586200…40829829516327075841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.682 × 10⁹⁷(98-digit number)
16827771340298717240…81659659032654151681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.365 × 10⁹⁷(98-digit number)
33655542680597434480…63319318065308303361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.731 × 10⁹⁷(98-digit number)
67311085361194868960…26638636130616606721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.346 × 10⁹⁸(99-digit number)
13462217072238973792…53277272261233213441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.692 × 10⁹⁸(99-digit number)
26924434144477947584…06554544522466426881
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,983,078 XPM·at block #6,842,333 · 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