Block #2,648,316

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/4/2018, 10:42:15 AM · Difficulty 11.7660 · 4,192,808 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4dc027e060f438858e9715ce6bd4e9a778f027e0d6ca5478026c9f708d522656

Height

#2,648,316

Difficulty

11.766023

Transactions

2

Size

573 B

Version

2

Bits

0bc41a18

Nonce

1,700,925,948

Timestamp

5/4/2018, 10:42:15 AM

Confirmations

4,192,808

Merkle Root

33c87d8db0d483a049c99bc44c786052bd7c772e7be455f9bafb9e88d887c4ca
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.

5.307 × 10⁹⁵(96-digit number)
53078184410855868619…77676367973339264721
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
5.307 × 10⁹⁵(96-digit number)
53078184410855868619…77676367973339264721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.061 × 10⁹⁶(97-digit number)
10615636882171173723…55352735946678529441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.123 × 10⁹⁶(97-digit number)
21231273764342347447…10705471893357058881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.246 × 10⁹⁶(97-digit number)
42462547528684694895…21410943786714117761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.492 × 10⁹⁶(97-digit number)
84925095057369389791…42821887573428235521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.698 × 10⁹⁷(98-digit number)
16985019011473877958…85643775146856471041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.397 × 10⁹⁷(98-digit number)
33970038022947755916…71287550293712942081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.794 × 10⁹⁷(98-digit number)
67940076045895511833…42575100587425884161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.358 × 10⁹⁸(99-digit number)
13588015209179102366…85150201174851768321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.717 × 10⁹⁸(99-digit number)
27176030418358204733…70300402349703536641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.435 × 10⁹⁸(99-digit number)
54352060836716409466…40600804699407073281
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,973,361 XPM·at block #6,841,123 · 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