Block #315,351

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2013, 11:16:04 AM · Difficulty 10.0962 · 6,495,020 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2c9bc892eb8d5d1958c5fb8d4638594fa882e5f097f318488210ec321d79db9b

Height

#315,351

Difficulty

10.096178

Transactions

1

Size

1.08 KB

Version

2

Bits

0a189f18

Nonce

48,463

Timestamp

12/16/2013, 11:16:04 AM

Confirmations

6,495,020

Merkle Root

7f8c7d99cf29c3177caa366014f90262dd79d5aa5a0f0bc7da13e99100880b9a
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.330 × 10⁹⁶(97-digit number)
43304459193011844577…56643220494090606681
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.330 × 10⁹⁶(97-digit number)
43304459193011844577…56643220494090606681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.660 × 10⁹⁶(97-digit number)
86608918386023689155…13286440988181213361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.732 × 10⁹⁷(98-digit number)
17321783677204737831…26572881976362426721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.464 × 10⁹⁷(98-digit number)
34643567354409475662…53145763952724853441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.928 × 10⁹⁷(98-digit number)
69287134708818951324…06291527905449706881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.385 × 10⁹⁸(99-digit number)
13857426941763790264…12583055810899413761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.771 × 10⁹⁸(99-digit number)
27714853883527580529…25166111621798827521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.542 × 10⁹⁸(99-digit number)
55429707767055161059…50332223243597655041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.108 × 10⁹⁹(100-digit number)
11085941553411032211…00664446487195310081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.217 × 10⁹⁹(100-digit number)
22171883106822064423…01328892974390620161
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,727,045 XPM·at block #6,810,370 · 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