Block #315,123

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2013, 8:39:25 AM · Difficulty 10.0853 · 6,516,601 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2d557bf202df9c488fcb52f7b4e886cc13bce79e3f4c68aee762d84f594700bd

Height

#315,123

Difficulty

10.085329

Transactions

5

Size

1.08 KB

Version

2

Bits

0a15d818

Nonce

1,002

Timestamp

12/16/2013, 8:39:25 AM

Confirmations

6,516,601

Merkle Root

d1133f8780e7f16b164388a6b5aa40d5c6d81d3a9608ac42b90b72e45963b80d
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.943 × 10⁹⁵(96-digit number)
79436103427272061857…64358387172464860161
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.943 × 10⁹⁵(96-digit number)
79436103427272061857…64358387172464860161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.588 × 10⁹⁶(97-digit number)
15887220685454412371…28716774344929720321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.177 × 10⁹⁶(97-digit number)
31774441370908824742…57433548689859440641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.354 × 10⁹⁶(97-digit number)
63548882741817649485…14867097379718881281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.270 × 10⁹⁷(98-digit number)
12709776548363529897…29734194759437762561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.541 × 10⁹⁷(98-digit number)
25419553096727059794…59468389518875525121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.083 × 10⁹⁷(98-digit number)
50839106193454119588…18936779037751050241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.016 × 10⁹⁸(99-digit number)
10167821238690823917…37873558075502100481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.033 × 10⁹⁸(99-digit number)
20335642477381647835…75747116151004200961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.067 × 10⁹⁸(99-digit number)
40671284954763295670…51494232302008401921
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,897,897 XPM·at block #6,831,723 · 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.
Privacy Policy·

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