Block #315,070

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/16/2013, 7:57:37 AM · Difficulty 10.0837 · 6,493,025 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
434a38ac565aad18163ca84ee6e5ab1f854efc7d4925860b59b367ac79b476c8

Height

#315,070

Difficulty

10.083732

Transactions

16

Size

6.93 KB

Version

2

Bits

0a156f7a

Nonce

258,381

Timestamp

12/16/2013, 7:57:37 AM

Confirmations

6,493,025

Merkle Root

014fddce172b41e6f6fe8f3e73c4138d22f0214766beafa837c96e958d41dd88
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.484 × 10⁹⁵(96-digit number)
14840035591556346333…32157295974075637621
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.484 × 10⁹⁵(96-digit number)
14840035591556346333…32157295974075637621
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.968 × 10⁹⁵(96-digit number)
29680071183112692666…64314591948151275241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.936 × 10⁹⁵(96-digit number)
59360142366225385332…28629183896302550481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.187 × 10⁹⁶(97-digit number)
11872028473245077066…57258367792605100961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.374 × 10⁹⁶(97-digit number)
23744056946490154133…14516735585210201921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.748 × 10⁹⁶(97-digit number)
47488113892980308266…29033471170420403841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.497 × 10⁹⁶(97-digit number)
94976227785960616532…58066942340840807681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.899 × 10⁹⁷(98-digit number)
18995245557192123306…16133884681681615361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.799 × 10⁹⁷(98-digit number)
37990491114384246612…32267769363363230721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.598 × 10⁹⁷(98-digit number)
75980982228768493225…64535538726726461441
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,708,806 XPM·at block #6,808,094 · 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