Block #2,646,388

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/3/2018, 8:21:45 AM · Difficulty 11.7493 · 4,187,515 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e99b5d859317424b34272ba19383e30875dd229da5a27e10297c99e1ee554b5c

Height

#2,646,388

Difficulty

11.749251

Transactions

7

Size

1.90 KB

Version

2

Bits

0bbfceea

Nonce

1,100,116,219

Timestamp

5/3/2018, 8:21:45 AM

Confirmations

4,187,515

Merkle Root

b5f6baad3fb4292b5ba7e9736dacf47ee2f327839e7d693ccd6d2d9af5d35e5a
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.

6.888 × 10⁹⁵(96-digit number)
68881729007585115794…33177389250247804799
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
6.888 × 10⁹⁵(96-digit number)
68881729007585115794…33177389250247804799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.377 × 10⁹⁶(97-digit number)
13776345801517023158…66354778500495609599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.755 × 10⁹⁶(97-digit number)
27552691603034046317…32709557000991219199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.510 × 10⁹⁶(97-digit number)
55105383206068092635…65419114001982438399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.102 × 10⁹⁷(98-digit number)
11021076641213618527…30838228003964876799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.204 × 10⁹⁷(98-digit number)
22042153282427237054…61676456007929753599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.408 × 10⁹⁷(98-digit number)
44084306564854474108…23352912015859507199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.816 × 10⁹⁷(98-digit number)
88168613129708948217…46705824031719014399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.763 × 10⁹⁸(99-digit number)
17633722625941789643…93411648063438028799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.526 × 10⁹⁸(99-digit number)
35267445251883579286…86823296126876057599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.053 × 10⁹⁸(99-digit number)
70534890503767158573…73646592253752115199
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,915,450 XPM·at block #6,833,902 · 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