Block #314,063

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/15/2013, 6:59:07 PM · Difficulty 10.0412 · 6,502,759 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
518100a6fbe48d45aea4c864469c8a37787c1f0e511ca79adc3ef5522f32366c

Height

#314,063

Difficulty

10.041194

Transactions

1

Size

1.08 KB

Version

2

Bits

0a0a8baa

Nonce

128,846

Timestamp

12/15/2013, 6:59:07 PM

Confirmations

6,502,759

Merkle Root

30d5f49549b53f042660e8da3871f38ad4e7bb6f9d57af0ab7d6659819363df5
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.

3.211 × 10⁹⁸(99-digit number)
32116477262856057875…70902157041858709481
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
3.211 × 10⁹⁸(99-digit number)
32116477262856057875…70902157041858709481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.423 × 10⁹⁸(99-digit number)
64232954525712115750…41804314083717418961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.284 × 10⁹⁹(100-digit number)
12846590905142423150…83608628167434837921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.569 × 10⁹⁹(100-digit number)
25693181810284846300…67217256334869675841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.138 × 10⁹⁹(100-digit number)
51386363620569692600…34434512669739351681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.027 × 10¹⁰⁰(101-digit number)
10277272724113938520…68869025339478703361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.055 × 10¹⁰⁰(101-digit number)
20554545448227877040…37738050678957406721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.110 × 10¹⁰⁰(101-digit number)
41109090896455754080…75476101357914813441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.221 × 10¹⁰⁰(101-digit number)
82218181792911508160…50952202715829626881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.644 × 10¹⁰¹(102-digit number)
16443636358582301632…01904405431659253761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.288 × 10¹⁰¹(102-digit number)
32887272717164603264…03808810863318507521
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,778,615 XPM·at block #6,816,821 · 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