Block #2,637,685

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/30/2018, 12:30:39 AM · Difficulty 11.4546 · 4,203,054 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
51b19d99e64bd22585385caa11da1873c6d017299ff30399d3f236875c9d814b

Height

#2,637,685

Difficulty

11.454580

Transactions

2

Size

1.86 KB

Version

2

Bits

0b745f53

Nonce

1,080,465,470

Timestamp

4/30/2018, 12:30:39 AM

Confirmations

4,203,054

Merkle Root

4be453c8a854aa505ed131eb25c872ae815cbd3a2d03efa304f42cb33db8f249
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.

9.903 × 10⁹³(94-digit number)
99030551623789202454…52241757113123824639
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
9.903 × 10⁹³(94-digit number)
99030551623789202454…52241757113123824639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.980 × 10⁹⁴(95-digit number)
19806110324757840490…04483514226247649279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.961 × 10⁹⁴(95-digit number)
39612220649515680981…08967028452495298559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.922 × 10⁹⁴(95-digit number)
79224441299031361963…17934056904990597119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.584 × 10⁹⁵(96-digit number)
15844888259806272392…35868113809981194239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.168 × 10⁹⁵(96-digit number)
31689776519612544785…71736227619962388479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.337 × 10⁹⁵(96-digit number)
63379553039225089571…43472455239924776959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.267 × 10⁹⁶(97-digit number)
12675910607845017914…86944910479849553919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.535 × 10⁹⁶(97-digit number)
25351821215690035828…73889820959699107839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.070 × 10⁹⁶(97-digit number)
50703642431380071656…47779641919398215679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.014 × 10⁹⁷(98-digit number)
10140728486276014331…95559283838796431359
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,970,255 XPM·at block #6,840,738 · 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