Block #2,598,067

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/3/2018, 7:14:50 AM · Difficulty 11.3146 · 4,239,616 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0eda88a66468d0c40d408c886b2cf2a3846046dc41fbc3ba8647cb125b17e329

Height

#2,598,067

Difficulty

11.314558

Transactions

2

Size

4.59 KB

Version

2

Bits

0b5086d8

Nonce

2,122,075,828

Timestamp

4/3/2018, 7:14:50 AM

Confirmations

4,239,616

Merkle Root

c71a0dd3a9d779b3bbb2e3180ab250150c35fa87a117ab5c7902ad4a83fbe880
Transactions (2)
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.894 × 10⁹⁵(96-digit number)
18941460477834873059…01386535369332729599
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.894 × 10⁹⁵(96-digit number)
18941460477834873059…01386535369332729599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.788 × 10⁹⁵(96-digit number)
37882920955669746118…02773070738665459199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.576 × 10⁹⁵(96-digit number)
75765841911339492237…05546141477330918399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.515 × 10⁹⁶(97-digit number)
15153168382267898447…11092282954661836799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.030 × 10⁹⁶(97-digit number)
30306336764535796894…22184565909323673599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.061 × 10⁹⁶(97-digit number)
60612673529071593789…44369131818647347199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.212 × 10⁹⁷(98-digit number)
12122534705814318757…88738263637294694399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.424 × 10⁹⁷(98-digit number)
24245069411628637515…77476527274589388799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.849 × 10⁹⁷(98-digit number)
48490138823257275031…54953054549178777599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.698 × 10⁹⁷(98-digit number)
96980277646514550063…09906109098357555199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.939 × 10⁹⁸(99-digit number)
19396055529302910012…19812218196715110399
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,945,790 XPM·at block #6,837,682 · 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