Block #312,479

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/15/2013, 1:07:21 AM · Difficulty 9.9958 · 6,495,116 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4ea5f673d0da0c500e5e55ad67e848f8750a92b1d2176d60b15f988ea11aae42

Height

#312,479

Difficulty

9.995825

Transactions

1

Size

834 B

Version

2

Bits

09feee5f

Nonce

76,355

Timestamp

12/15/2013, 1:07:21 AM

Confirmations

6,495,116

Merkle Root

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

9.987 × 10⁹⁷(98-digit number)
99870750863518450348…34260956490586800001
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
9.987 × 10⁹⁷(98-digit number)
99870750863518450348…34260956490586800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.997 × 10⁹⁸(99-digit number)
19974150172703690069…68521912981173600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.994 × 10⁹⁸(99-digit number)
39948300345407380139…37043825962347200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.989 × 10⁹⁸(99-digit number)
79896600690814760278…74087651924694400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.597 × 10⁹⁹(100-digit number)
15979320138162952055…48175303849388800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.195 × 10⁹⁹(100-digit number)
31958640276325904111…96350607698777600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.391 × 10⁹⁹(100-digit number)
63917280552651808222…92701215397555200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.278 × 10¹⁰⁰(101-digit number)
12783456110530361644…85402430795110400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.556 × 10¹⁰⁰(101-digit number)
25566912221060723289…70804861590220800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.113 × 10¹⁰⁰(101-digit number)
51133824442121446578…41609723180441600001
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,704,788 XPM·at block #6,807,594 · 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