Block #2,988,549

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/30/2018, 7:40:42 PM · Difficulty 11.2687 · 3,848,218 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c7fed09e1446cc9ba0577d23da66491dc9c04e60a87bc4349948c784f6236264

Height

#2,988,549

Difficulty

11.268705

Transactions

4

Size

1.38 KB

Version

2

Bits

0b44c9d2

Nonce

353,944,095

Timestamp

12/30/2018, 7:40:42 PM

Confirmations

3,848,218

Merkle Root

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

8.957 × 10⁹⁵(96-digit number)
89576809344560062761…32073506025143009279
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
8.957 × 10⁹⁵(96-digit number)
89576809344560062761…32073506025143009279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.791 × 10⁹⁶(97-digit number)
17915361868912012552…64147012050286018559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.583 × 10⁹⁶(97-digit number)
35830723737824025104…28294024100572037119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.166 × 10⁹⁶(97-digit number)
71661447475648050209…56588048201144074239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.433 × 10⁹⁷(98-digit number)
14332289495129610041…13176096402288148479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.866 × 10⁹⁷(98-digit number)
28664578990259220083…26352192804576296959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.732 × 10⁹⁷(98-digit number)
57329157980518440167…52704385609152593919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.146 × 10⁹⁸(99-digit number)
11465831596103688033…05408771218305187839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.293 × 10⁹⁸(99-digit number)
22931663192207376067…10817542436610375679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.586 × 10⁹⁸(99-digit number)
45863326384414752134…21635084873220751359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.172 × 10⁹⁸(99-digit number)
91726652768829504268…43270169746441502719
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,938,419 XPM·at block #6,836,766 · 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