Block #2,288,152

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/8/2017, 6:14:08 PM · Difficulty 10.9556 · 4,553,001 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8748407267638e227227c2f1b5de61f44c3ad8ce587920e80ff7f4233de95be6

Height

#2,288,152

Difficulty

10.955557

Transactions

9

Size

3.42 KB

Version

2

Bits

0af49f67

Nonce

150,933,007

Timestamp

9/8/2017, 6:14:08 PM

Confirmations

4,553,001

Merkle Root

f9335de3975780e18e4319957acca0bb34a0a18b40c61bbc2c0dbb487858a0ad
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.250 × 10⁹³(94-digit number)
72507379435037627595…96735706455243007999
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.250 × 10⁹³(94-digit number)
72507379435037627595…96735706455243007999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.450 × 10⁹⁴(95-digit number)
14501475887007525519…93471412910486015999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.900 × 10⁹⁴(95-digit number)
29002951774015051038…86942825820972031999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.800 × 10⁹⁴(95-digit number)
58005903548030102076…73885651641944063999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.160 × 10⁹⁵(96-digit number)
11601180709606020415…47771303283888127999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.320 × 10⁹⁵(96-digit number)
23202361419212040830…95542606567776255999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.640 × 10⁹⁵(96-digit number)
46404722838424081660…91085213135552511999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.280 × 10⁹⁵(96-digit number)
92809445676848163321…82170426271105023999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.856 × 10⁹⁶(97-digit number)
18561889135369632664…64340852542210047999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.712 × 10⁹⁶(97-digit number)
37123778270739265328…28681705084420095999
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 First 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 1CC formula:

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