Block #2,601,722

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/5/2018, 7:58:32 PM · Difficulty 11.3162 · 4,241,398 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3dfdf18cefb452f6a0f14c59ab30fe57dedbbf17625329a5937eeff24f5464fc

Height

#2,601,722

Difficulty

11.316243

Transactions

4

Size

1.13 KB

Version

2

Bits

0b50f54f

Nonce

135,594,996

Timestamp

4/5/2018, 7:58:32 PM

Confirmations

4,241,398

Merkle Root

351ba062ec135712e86595fa1631597007dc7cf5d9c29dbe9a9f4ba48decaf53
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.

5.685 × 10⁹⁴(95-digit number)
56857458028630096645…78555850757585700239
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
5.685 × 10⁹⁴(95-digit number)
56857458028630096645…78555850757585700239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.137 × 10⁹⁵(96-digit number)
11371491605726019329…57111701515171400479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.274 × 10⁹⁵(96-digit number)
22742983211452038658…14223403030342800959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.548 × 10⁹⁵(96-digit number)
45485966422904077316…28446806060685601919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.097 × 10⁹⁵(96-digit number)
90971932845808154632…56893612121371203839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.819 × 10⁹⁶(97-digit number)
18194386569161630926…13787224242742407679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.638 × 10⁹⁶(97-digit number)
36388773138323261852…27574448485484815359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.277 × 10⁹⁶(97-digit number)
72777546276646523705…55148896970969630719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.455 × 10⁹⁷(98-digit number)
14555509255329304741…10297793941939261439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.911 × 10⁹⁷(98-digit number)
29111018510658609482…20595587883878522879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.822 × 10⁹⁷(98-digit number)
58222037021317218964…41191175767757045759
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,989,325 XPM·at block #6,843,119 · 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