Block #876,115

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/31/2014, 3:06:37 AM · Difficulty 10.9650 · 5,930,257 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
31418c2e2612d6423607144a1c662f951a77cf98bbe1d01d1c3941b57084c21d

Height

#876,115

Difficulty

10.965030

Transactions

2

Size

1.29 KB

Version

2

Bits

0af70c31

Nonce

659,690,527

Timestamp

12/31/2014, 3:06:37 AM

Confirmations

5,930,257

Merkle Root

2d2e26bd338e7a8ec4959b0d795a2861f01f8e12760a36d042c641e524034c3b
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.

8.063 × 10⁹⁷(98-digit number)
80630601358782033890…68628359364708531201
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
8.063 × 10⁹⁷(98-digit number)
80630601358782033890…68628359364708531201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.612 × 10⁹⁸(99-digit number)
16126120271756406778…37256718729417062401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.225 × 10⁹⁸(99-digit number)
32252240543512813556…74513437458834124801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.450 × 10⁹⁸(99-digit number)
64504481087025627112…49026874917668249601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.290 × 10⁹⁹(100-digit number)
12900896217405125422…98053749835336499201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.580 × 10⁹⁹(100-digit number)
25801792434810250844…96107499670672998401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.160 × 10⁹⁹(100-digit number)
51603584869620501689…92214999341345996801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.032 × 10¹⁰⁰(101-digit number)
10320716973924100337…84429998682691993601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.064 × 10¹⁰⁰(101-digit number)
20641433947848200675…68859997365383987201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.128 × 10¹⁰⁰(101-digit number)
41282867895696401351…37719994730767974401
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,695,064 XPM·at block #6,806,371 · 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.

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