Block #2,626,286

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/23/2018, 10:05:58 AM · Difficulty 11.2054 · 4,216,017 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
7b2d8903760dd6fb771f0e743f5635e5ce7945619a7c7b253740d4c46674f7fa

Height

#2,626,286

Difficulty

11.205390

Transactions

34

Size

8.77 KB

Version

2

Bits

0b349474

Nonce

509,185,007

Timestamp

4/23/2018, 10:05:58 AM

Confirmations

4,216,017

Merkle Root

b11f87b87fb960bf762ba8e5c5c2ef454b15a82bc57134c66fec1655a61b8974
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.222 × 10⁹⁵(96-digit number)
72222096448201823994…20098632776195891199
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.222 × 10⁹⁵(96-digit number)
72222096448201823994…20098632776195891199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.444 × 10⁹⁶(97-digit number)
14444419289640364798…40197265552391782399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.888 × 10⁹⁶(97-digit number)
28888838579280729597…80394531104783564799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.777 × 10⁹⁶(97-digit number)
57777677158561459195…60789062209567129599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.155 × 10⁹⁷(98-digit number)
11555535431712291839…21578124419134259199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.311 × 10⁹⁷(98-digit number)
23111070863424583678…43156248838268518399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.622 × 10⁹⁷(98-digit number)
46222141726849167356…86312497676537036799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.244 × 10⁹⁷(98-digit number)
92444283453698334712…72624995353074073599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.848 × 10⁹⁸(99-digit number)
18488856690739666942…45249990706148147199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.697 × 10⁹⁸(99-digit number)
36977713381479333885…90499981412296294399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.395 × 10⁹⁸(99-digit number)
73955426762958667770…80999962824592588799
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,982,829 XPM·at block #6,842,302 · 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