Block #2,824,131

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/4/2018, 9:00:46 AM · Difficulty 11.7082 · 4,015,262 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
70bed5f1c920c3123d3279d066a31eb608992ef7596d5a375d6bf185f73c0f79

Height

#2,824,131

Difficulty

11.708181

Transactions

6

Size

2.11 KB

Version

2

Bits

0bb54b58

Nonce

978,472,512

Timestamp

9/4/2018, 9:00:46 AM

Confirmations

4,015,262

Merkle Root

8c4a22fa2b55872a6e13c083265fabf5c517d2fdb2f4282b0864dd490c71d89a
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.

7.850 × 10⁹⁵(96-digit number)
78506330981060238640…09386790567386036479
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
7.850 × 10⁹⁵(96-digit number)
78506330981060238640…09386790567386036479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.570 × 10⁹⁶(97-digit number)
15701266196212047728…18773581134772072959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.140 × 10⁹⁶(97-digit number)
31402532392424095456…37547162269544145919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.280 × 10⁹⁶(97-digit number)
62805064784848190912…75094324539088291839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.256 × 10⁹⁷(98-digit number)
12561012956969638182…50188649078176583679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.512 × 10⁹⁷(98-digit number)
25122025913939276365…00377298156353167359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.024 × 10⁹⁷(98-digit number)
50244051827878552730…00754596312706334719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.004 × 10⁹⁸(99-digit number)
10048810365575710546…01509192625412669439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.009 × 10⁹⁸(99-digit number)
20097620731151421092…03018385250825338879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.019 × 10⁹⁸(99-digit number)
40195241462302842184…06036770501650677759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.039 × 10⁹⁸(99-digit number)
80390482924605684368…12073541003301355519
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,959,429 XPM·at block #6,839,392 · 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