Block #2,287,366

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 9/8/2017, 5:11:04 AM · Difficulty 10.9555 · 4,554,251 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4a6389f0b30445e98562beca461a26916b3e5b122e12361d795e7d6ccd1492b4

Height

#2,287,366

Difficulty

10.955487

Transactions

6

Size

2.19 KB

Version

2

Bits

0af49ad1

Nonce

1,549,365,291

Timestamp

9/8/2017, 5:11:04 AM

Confirmations

4,554,251

Merkle Root

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

2.411 × 10⁹⁴(95-digit number)
24116999453640035562…84093873410575473321
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
2.411 × 10⁹⁴(95-digit number)
24116999453640035562…84093873410575473321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.823 × 10⁹⁴(95-digit number)
48233998907280071125…68187746821150946641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.646 × 10⁹⁴(95-digit number)
96467997814560142250…36375493642301893281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.929 × 10⁹⁵(96-digit number)
19293599562912028450…72750987284603786561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.858 × 10⁹⁵(96-digit number)
38587199125824056900…45501974569207573121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.717 × 10⁹⁵(96-digit number)
77174398251648113800…91003949138415146241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.543 × 10⁹⁶(97-digit number)
15434879650329622760…82007898276830292481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.086 × 10⁹⁶(97-digit number)
30869759300659245520…64015796553660584961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.173 × 10⁹⁶(97-digit number)
61739518601318491040…28031593107321169921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.234 × 10⁹⁷(98-digit number)
12347903720263698208…56063186214642339841
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,977,318 XPM·at block #6,841,616 · 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