Block #2,649,978

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/5/2018, 4:17:40 PM · Difficulty 11.7607 · 4,190,858 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
91eb132c5b9e7d9f4d2866bdf7e99935201dc3dc584a6aaa512d81f3de121fb4

Height

#2,649,978

Difficulty

11.760655

Transactions

2

Size

871 B

Version

2

Bits

0bc2ba42

Nonce

1,481,604,396

Timestamp

5/5/2018, 4:17:40 PM

Confirmations

4,190,858

Merkle Root

6657a76ad3d1e67fa966f8ebc6a9cd77e43594789d74750d2bd399c9c68296fe
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.

1.954 × 10⁹⁶(97-digit number)
19544808868126049378…85873516979681523199
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.954 × 10⁹⁶(97-digit number)
19544808868126049378…85873516979681523199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.908 × 10⁹⁶(97-digit number)
39089617736252098757…71747033959363046399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.817 × 10⁹⁶(97-digit number)
78179235472504197515…43494067918726092799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.563 × 10⁹⁷(98-digit number)
15635847094500839503…86988135837452185599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.127 × 10⁹⁷(98-digit number)
31271694189001679006…73976271674904371199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.254 × 10⁹⁷(98-digit number)
62543388378003358012…47952543349808742399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.250 × 10⁹⁸(99-digit number)
12508677675600671602…95905086699617484799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.501 × 10⁹⁸(99-digit number)
25017355351201343205…91810173399234969599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.003 × 10⁹⁸(99-digit number)
50034710702402686410…83620346798469939199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.000 × 10⁹⁹(100-digit number)
10006942140480537282…67240693596939878399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.001 × 10⁹⁹(100-digit number)
20013884280961074564…34481387193879756799
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,971,033 XPM·at block #6,840,835 · 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