Block #318,312

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/18/2013, 6:47:50 AM · Difficulty 10.1597 · 6,488,526 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
309d9830f8138357f752918107ac57c842e2398314c950661cbaf48b0afa142e

Height

#318,312

Difficulty

10.159713

Transactions

16

Size

4.59 KB

Version

2

Bits

0a28e2f3

Nonce

34,720

Timestamp

12/18/2013, 6:47:50 AM

Confirmations

6,488,526

Merkle Root

1eeaaf3ff26faff84d258ddac47084fbb198de7ef5a33a8f568cf97e719c7fc2
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.

1.990 × 10¹⁰¹(102-digit number)
19905504424095631741…02609091373645027241
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
1.990 × 10¹⁰¹(102-digit number)
19905504424095631741…02609091373645027241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.981 × 10¹⁰¹(102-digit number)
39811008848191263482…05218182747290054481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.962 × 10¹⁰¹(102-digit number)
79622017696382526964…10436365494580108961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.592 × 10¹⁰²(103-digit number)
15924403539276505392…20872730989160217921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.184 × 10¹⁰²(103-digit number)
31848807078553010785…41745461978320435841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.369 × 10¹⁰²(103-digit number)
63697614157106021571…83490923956640871681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.273 × 10¹⁰³(104-digit number)
12739522831421204314…66981847913281743361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.547 × 10¹⁰³(104-digit number)
25479045662842408628…33963695826563486721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.095 × 10¹⁰³(104-digit number)
50958091325684817257…67927391653126973441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.019 × 10¹⁰⁴(105-digit number)
10191618265136963451…35854783306253946881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.038 × 10¹⁰⁴(105-digit number)
20383236530273926902…71709566612507893761
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,698,807 XPM·at block #6,806,837 · 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