Block #2,238,225

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/5/2017, 3:35:45 PM · Difficulty 10.9461 · 4,599,402 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f4c7080df9fa9c2e5c69b63a1bae827a7e5dafa02887904c8d469b58baa87fba

Height

#2,238,225

Difficulty

10.946123

Transactions

6

Size

3.33 KB

Version

2

Bits

0af23526

Nonce

848,733,289

Timestamp

8/5/2017, 3:35:45 PM

Confirmations

4,599,402

Merkle Root

14e866218dbf4c588fbb70d0df9e4865c21fd079dbbc4eeab135b0798cf12022
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.174 × 10⁹⁷(98-digit number)
11748495120297230230…16300313197162188801
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.174 × 10⁹⁷(98-digit number)
11748495120297230230…16300313197162188801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.349 × 10⁹⁷(98-digit number)
23496990240594460461…32600626394324377601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.699 × 10⁹⁷(98-digit number)
46993980481188920922…65201252788648755201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.398 × 10⁹⁷(98-digit number)
93987960962377841845…30402505577297510401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.879 × 10⁹⁸(99-digit number)
18797592192475568369…60805011154595020801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.759 × 10⁹⁸(99-digit number)
37595184384951136738…21610022309190041601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.519 × 10⁹⁸(99-digit number)
75190368769902273476…43220044618380083201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.503 × 10⁹⁹(100-digit number)
15038073753980454695…86440089236760166401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.007 × 10⁹⁹(100-digit number)
30076147507960909390…72880178473520332801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.015 × 10⁹⁹(100-digit number)
60152295015921818781…45760356947040665601
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,945,340 XPM·at block #6,837,626 · 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