Block #2,291,631

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/11/2017, 5:17:43 AM · Difficulty 10.9551 · 4,535,557 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b3a93e070f4e633c60970666cf534cbaa2ad90954bd221ba49c6909e4ac5aac1

Height

#2,291,631

Difficulty

10.955067

Transactions

2

Size

426 B

Version

2

Bits

0af47f48

Nonce

124,474,922

Timestamp

9/11/2017, 5:17:43 AM

Confirmations

4,535,557

Merkle Root

cf78b0b81edecf6947637e8838b53005e4ef6b46222b07f941ae9d68feb63b32
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.

7.109 × 10⁹³(94-digit number)
71092019800562084180…23387436381999564801
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
7.109 × 10⁹³(94-digit number)
71092019800562084180…23387436381999564801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.421 × 10⁹⁴(95-digit number)
14218403960112416836…46774872763999129601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.843 × 10⁹⁴(95-digit number)
28436807920224833672…93549745527998259201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.687 × 10⁹⁴(95-digit number)
56873615840449667344…87099491055996518401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.137 × 10⁹⁵(96-digit number)
11374723168089933468…74198982111993036801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.274 × 10⁹⁵(96-digit number)
22749446336179866937…48397964223986073601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.549 × 10⁹⁵(96-digit number)
45498892672359733875…96795928447972147201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.099 × 10⁹⁵(96-digit number)
90997785344719467751…93591856895944294401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.819 × 10⁹⁶(97-digit number)
18199557068943893550…87183713791888588801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.639 × 10⁹⁶(97-digit number)
36399114137887787100…74367427583777177601
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,861,601 XPM·at block #6,827,187 · 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