Block #2,730,628

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 7/2/2018, 5:10:44 AM · Difficulty 11.6326 · 4,112,264 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
54e9fe1cd7e5cf7b9976c06b85870d074ff4a4b1cdd6925ac72418e3906aedf3

Height

#2,730,628

Difficulty

11.632556

Transactions

4

Size

1.00 KB

Version

2

Bits

0ba1ef29

Nonce

337,949,310

Timestamp

7/2/2018, 5:10:44 AM

Confirmations

4,112,264

Merkle Root

137d105e655ad2f0e91d12b35bb9f82c741d48a471d0be030350ac79077c455d
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.022 × 10⁹⁵(96-digit number)
10224817416816169770…32562785646220603519
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.022 × 10⁹⁵(96-digit number)
10224817416816169770…32562785646220603519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.044 × 10⁹⁵(96-digit number)
20449634833632339540…65125571292441207039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.089 × 10⁹⁵(96-digit number)
40899269667264679080…30251142584882414079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.179 × 10⁹⁵(96-digit number)
81798539334529358160…60502285169764828159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.635 × 10⁹⁶(97-digit number)
16359707866905871632…21004570339529656319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.271 × 10⁹⁶(97-digit number)
32719415733811743264…42009140679059312639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.543 × 10⁹⁶(97-digit number)
65438831467623486528…84018281358118625279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.308 × 10⁹⁷(98-digit number)
13087766293524697305…68036562716237250559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.617 × 10⁹⁷(98-digit number)
26175532587049394611…36073125432474501119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.235 × 10⁹⁷(98-digit number)
52351065174098789222…72146250864949002239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.047 × 10⁹⁸(99-digit number)
10470213034819757844…44292501729898004479
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,987,483 XPM·at block #6,842,891 · 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