Block #315,704

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2013, 3:51:37 PM · Difficulty 10.1123 · 6,491,651 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
97caebbf3e86f67ff5ab5a3de9b98762e7c81e7eabfa4f73ee68e6453ad0a1c2

Height

#315,704

Difficulty

10.112349

Transactions

17

Size

14.93 KB

Version

2

Bits

0a1cc2e0

Nonce

239,174

Timestamp

12/16/2013, 3:51:37 PM

Confirmations

6,491,651

Merkle Root

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

4.146 × 10¹⁰²(103-digit number)
41469703521178623235…00937616058677678081
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
4.146 × 10¹⁰²(103-digit number)
41469703521178623235…00937616058677678081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.293 × 10¹⁰²(103-digit number)
82939407042357246470…01875232117355356161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.658 × 10¹⁰³(104-digit number)
16587881408471449294…03750464234710712321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.317 × 10¹⁰³(104-digit number)
33175762816942898588…07500928469421424641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.635 × 10¹⁰³(104-digit number)
66351525633885797176…15001856938842849281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.327 × 10¹⁰⁴(105-digit number)
13270305126777159435…30003713877685698561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.654 × 10¹⁰⁴(105-digit number)
26540610253554318870…60007427755371397121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.308 × 10¹⁰⁴(105-digit number)
53081220507108637740…20014855510742794241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.061 × 10¹⁰⁵(106-digit number)
10616244101421727548…40029711021485588481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.123 × 10¹⁰⁵(106-digit number)
21232488202843455096…80059422042971176961
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,702,861 XPM·at block #6,807,354 · 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