Block #315,191

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2013, 9:32:08 AM · Difficulty 10.0883 · 6,491,118 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9e19ed53054695ee5759cee3e49cc3bbc53610126b495115a7917cbe46af44ba

Height

#315,191

Difficulty

10.088307

Transactions

8

Size

5.77 KB

Version

2

Bits

0a169b4c

Nonce

92,195

Timestamp

12/16/2013, 9:32:08 AM

Confirmations

6,491,118

Merkle Root

b8fe9edf9ab717923b5e51787c762679a69e3007ee3423556e624a445fcaa723
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.569 × 10⁹⁸(99-digit number)
75698544661436563144…57397199199505352081
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.569 × 10⁹⁸(99-digit number)
75698544661436563144…57397199199505352081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.513 × 10⁹⁹(100-digit number)
15139708932287312628…14794398399010704161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.027 × 10⁹⁹(100-digit number)
30279417864574625257…29588796798021408321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.055 × 10⁹⁹(100-digit number)
60558835729149250515…59177593596042816641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.211 × 10¹⁰⁰(101-digit number)
12111767145829850103…18355187192085633281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.422 × 10¹⁰⁰(101-digit number)
24223534291659700206…36710374384171266561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.844 × 10¹⁰⁰(101-digit number)
48447068583319400412…73420748768342533121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.689 × 10¹⁰⁰(101-digit number)
96894137166638800825…46841497536685066241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.937 × 10¹⁰¹(102-digit number)
19378827433327760165…93682995073370132481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.875 × 10¹⁰¹(102-digit number)
38757654866655520330…87365990146740264961
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,694,560 XPM·at block #6,806,308 · 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