Block #2,651,876

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/7/2018, 4:18:32 AM · Difficulty 11.7483 · 4,181,189 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c7c0c04a4bc8cbc1ce54c8f70492a91498cf44bd4be00eb87d0706b886d10412

Height

#2,651,876

Difficulty

11.748250

Transactions

7

Size

1.42 KB

Version

2

Bits

0bbf8d53

Nonce

632,587,390

Timestamp

5/7/2018, 4:18:32 AM

Confirmations

4,181,189

Merkle Root

fa2a84a7869e98ed085e88f3cd48640c2ab7518eb25c31915f31c2ebd3834b42
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.279 × 10⁹⁵(96-digit number)
12796471319759176585…35821295670940930359
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.279 × 10⁹⁵(96-digit number)
12796471319759176585…35821295670940930359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.559 × 10⁹⁵(96-digit number)
25592942639518353170…71642591341881860719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.118 × 10⁹⁵(96-digit number)
51185885279036706340…43285182683763721439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.023 × 10⁹⁶(97-digit number)
10237177055807341268…86570365367527442879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.047 × 10⁹⁶(97-digit number)
20474354111614682536…73140730735054885759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.094 × 10⁹⁶(97-digit number)
40948708223229365072…46281461470109771519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.189 × 10⁹⁶(97-digit number)
81897416446458730144…92562922940219543039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.637 × 10⁹⁷(98-digit number)
16379483289291746028…85125845880439086079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.275 × 10⁹⁷(98-digit number)
32758966578583492057…70251691760878172159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.551 × 10⁹⁷(98-digit number)
65517933157166984115…40503383521756344319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.310 × 10⁹⁸(99-digit number)
13103586631433396823…81006767043512688639
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,908,691 XPM·at block #6,833,064 · 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