Block #845,210

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/8/2014, 5:14:48 PM · Difficulty 10.9726 · 5,987,923 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a8dbcbbcf5af1a787098f706284296218919b75f84a65d7ecd4af295ddfdeaf3

Height

#845,210

Difficulty

10.972583

Transactions

3

Size

657 B

Version

2

Bits

0af8fb2b

Nonce

299,318,684

Timestamp

12/8/2014, 5:14:48 PM

Confirmations

5,987,923

Merkle Root

109f25f034ef9d9b22aa48e9d9f84e28e6db834a7b9744d4e4ed36fe20ca978b
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.529 × 10⁹⁵(96-digit number)
25295490840676131031…71084313495657464001
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.529 × 10⁹⁵(96-digit number)
25295490840676131031…71084313495657464001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.059 × 10⁹⁵(96-digit number)
50590981681352262062…42168626991314928001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.011 × 10⁹⁶(97-digit number)
10118196336270452412…84337253982629856001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.023 × 10⁹⁶(97-digit number)
20236392672540904824…68674507965259712001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.047 × 10⁹⁶(97-digit number)
40472785345081809649…37349015930519424001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.094 × 10⁹⁶(97-digit number)
80945570690163619299…74698031861038848001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.618 × 10⁹⁷(98-digit number)
16189114138032723859…49396063722077696001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.237 × 10⁹⁷(98-digit number)
32378228276065447719…98792127444155392001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.475 × 10⁹⁷(98-digit number)
64756456552130895439…97584254888310784001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.295 × 10⁹⁸(99-digit number)
12951291310426179087…95168509776621568001
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,909,242 XPM·at block #6,833,132 · 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