Block #315,675

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/16/2013, 3:21:56 PM · Difficulty 10.1123 · 6,501,790 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b1ed21c994dda3272ae3ff0802b82a57bde09f69147aa5105f61e3ef9f9fb71c

Height

#315,675

Difficulty

10.112297

Transactions

14

Size

6.10 KB

Version

2

Bits

0a1cbf84

Nonce

27,238

Timestamp

12/16/2013, 3:21:56 PM

Confirmations

6,501,790

Merkle Root

f5ffa097c5ab2c49bff331b5cb80f2b93c6a86a6bddaf0c93ff9cef05dc2f4ba
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.352 × 10¹⁰⁰(101-digit number)
13520030065565789529…58758630329908419699
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.352 × 10¹⁰⁰(101-digit number)
13520030065565789529…58758630329908419699
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.704 × 10¹⁰⁰(101-digit number)
27040060131131579059…17517260659816839399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.408 × 10¹⁰⁰(101-digit number)
54080120262263158119…35034521319633678799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.081 × 10¹⁰¹(102-digit number)
10816024052452631623…70069042639267357599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.163 × 10¹⁰¹(102-digit number)
21632048104905263247…40138085278534715199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.326 × 10¹⁰¹(102-digit number)
43264096209810526495…80276170557069430399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.652 × 10¹⁰¹(102-digit number)
86528192419621052990…60552341114138860799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.730 × 10¹⁰²(103-digit number)
17305638483924210598…21104682228277721599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.461 × 10¹⁰²(103-digit number)
34611276967848421196…42209364456555443199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.922 × 10¹⁰²(103-digit number)
69222553935696842392…84418728913110886399
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,783,771 XPM·at block #6,817,464 · 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