Block #313,943

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/15/2013, 5:34:58 PM · Difficulty 10.0344 · 6,494,858 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c14687cbb0a6b511eb9391a2383a2f7bba1ffb76f2b01829fd2cb9a2d501fb77

Height

#313,943

Difficulty

10.034443

Transactions

23

Size

6.14 KB

Version

2

Bits

0a08d13e

Nonce

319,146

Timestamp

12/15/2013, 5:34:58 PM

Confirmations

6,494,858

Merkle Root

30e08c031cee05ba2861337e6b417a47cd70fa963bd32bb2a85262a562154a7c
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.558 × 10⁹⁴(95-digit number)
15585840895503370157…57026185828844051681
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.558 × 10⁹⁴(95-digit number)
15585840895503370157…57026185828844051681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.117 × 10⁹⁴(95-digit number)
31171681791006740314…14052371657688103361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.234 × 10⁹⁴(95-digit number)
62343363582013480628…28104743315376206721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.246 × 10⁹⁵(96-digit number)
12468672716402696125…56209486630752413441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.493 × 10⁹⁵(96-digit number)
24937345432805392251…12418973261504826881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.987 × 10⁹⁵(96-digit number)
49874690865610784502…24837946523009653761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.974 × 10⁹⁵(96-digit number)
99749381731221569005…49675893046019307521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.994 × 10⁹⁶(97-digit number)
19949876346244313801…99351786092038615041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.989 × 10⁹⁶(97-digit number)
39899752692488627602…98703572184077230081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.979 × 10⁹⁶(97-digit number)
79799505384977255204…97407144368154460161
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,714,462 XPM·at block #6,808,800 · 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