Block #2,634,488

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/28/2018, 10:10:48 PM · Difficulty 11.2484 · 4,208,794 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d057aa64f3c01601df3ec79b770cc476afc11aeb22b1c26adfbfe17cfefcf18a

Height

#2,634,488

Difficulty

11.248370

Transactions

11

Size

4.01 KB

Version

2

Bits

0b3f952e

Nonce

129,933,752

Timestamp

4/28/2018, 10:10:48 PM

Confirmations

4,208,794

Merkle Root

bdde1cef03893c990389ff5b140c614516ac48478c1980304da9759832a3be2b
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.

1.768 × 10⁹⁶(97-digit number)
17689344913893455432…67432894363776723839
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
1.768 × 10⁹⁶(97-digit number)
17689344913893455432…67432894363776723839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.537 × 10⁹⁶(97-digit number)
35378689827786910864…34865788727553447679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.075 × 10⁹⁶(97-digit number)
70757379655573821729…69731577455106895359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.415 × 10⁹⁷(98-digit number)
14151475931114764345…39463154910213790719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.830 × 10⁹⁷(98-digit number)
28302951862229528691…78926309820427581439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.660 × 10⁹⁷(98-digit number)
56605903724459057383…57852619640855162879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.132 × 10⁹⁸(99-digit number)
11321180744891811476…15705239281710325759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.264 × 10⁹⁸(99-digit number)
22642361489783622953…31410478563420651519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.528 × 10⁹⁸(99-digit number)
45284722979567245906…62820957126841303039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.056 × 10⁹⁸(99-digit number)
90569445959134491813…25641914253682606079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.811 × 10⁹⁹(100-digit number)
18113889191826898362…51283828507365212159
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,990,628 XPM·at block #6,843,281 · 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