Block #2,291,425

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/11/2017, 1:50:03 AM · Difficulty 10.9551 · 4,550,820 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f0103825974ba2044220df2e50615663db5c2c79de86f3b5bbb767a202fe4186

Height

#2,291,425

Difficulty

10.955079

Transactions

11

Size

4.48 KB

Version

2

Bits

0af48009

Nonce

607,626,231

Timestamp

9/11/2017, 1:50:03 AM

Confirmations

4,550,820

Merkle Root

f09f61a9380f04dac946ca483c3967809bd7b3ac2b318b5953b03e7ff948aad1
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.401 × 10⁹⁴(95-digit number)
44014640893262263739…12662361764046617841
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.401 × 10⁹⁴(95-digit number)
44014640893262263739…12662361764046617841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.802 × 10⁹⁴(95-digit number)
88029281786524527479…25324723528093235681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.760 × 10⁹⁵(96-digit number)
17605856357304905495…50649447056186471361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.521 × 10⁹⁵(96-digit number)
35211712714609810991…01298894112372942721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.042 × 10⁹⁵(96-digit number)
70423425429219621983…02597788224745885441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.408 × 10⁹⁶(97-digit number)
14084685085843924396…05195576449491770881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.816 × 10⁹⁶(97-digit number)
28169370171687848793…10391152898983541761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.633 × 10⁹⁶(97-digit number)
56338740343375697586…20782305797967083521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.126 × 10⁹⁷(98-digit number)
11267748068675139517…41564611595934167041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.253 × 10⁹⁷(98-digit number)
22535496137350279034…83129223191868334081
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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,982,358 XPM·at block #6,842,244 · 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