Block #2,540,925

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 2/27/2018, 1:25:56 PM · Difficulty 10.9871 · 4,265,431 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0bd1e6bc230bc498b2782079b1ef9165bfeab5161f6d6ea8ece7f5a8a81b1a2b

Height

#2,540,925

Difficulty

10.987119

Transactions

6

Size

1.78 KB

Version

2

Bits

0afcb3d1

Nonce

659,481,941

Timestamp

2/27/2018, 1:25:56 PM

Confirmations

4,265,431

Merkle Root

48773b1f379ea79f068ac9d2702736de19bde96f1ea0169e044efa9726bb0106
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.

4.437 × 10⁹³(94-digit number)
44373818583374558631…46808964667753666561
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
4.437 × 10⁹³(94-digit number)
44373818583374558631…46808964667753666561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.874 × 10⁹³(94-digit number)
88747637166749117262…93617929335507333121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.774 × 10⁹⁴(95-digit number)
17749527433349823452…87235858671014666241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.549 × 10⁹⁴(95-digit number)
35499054866699646905…74471717342029332481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.099 × 10⁹⁴(95-digit number)
70998109733399293810…48943434684058664961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.419 × 10⁹⁵(96-digit number)
14199621946679858762…97886869368117329921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.839 × 10⁹⁵(96-digit number)
28399243893359717524…95773738736234659841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.679 × 10⁹⁵(96-digit number)
56798487786719435048…91547477472469319681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.135 × 10⁹⁶(97-digit number)
11359697557343887009…83094954944938639361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.271 × 10⁹⁶(97-digit number)
22719395114687774019…66189909889877278721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.543 × 10⁹⁶(97-digit number)
45438790229375548038…32379819779754557441
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,694,935 XPM·at block #6,806,355 · 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.

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