Block #314,122

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/15/2013, 7:38:31 PM · Difficulty 10.0444 · 6,503,809 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2768458d81c6f9defb99838a586a290e7f7d41217352d91f7111265517909718

Height

#314,122

Difficulty

10.044412

Transactions

5

Size

1.37 KB

Version

2

Bits

0a0b5e93

Nonce

41,794

Timestamp

12/15/2013, 7:38:31 PM

Confirmations

6,503,809

Merkle Root

315b536c62c48d595976674aab382422c847291d55253f7e5a802da14e301f11
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.

7.787 × 10¹⁰⁰(101-digit number)
77873656429074753298…20962507556943910359
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
7.787 × 10¹⁰⁰(101-digit number)
77873656429074753298…20962507556943910359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.557 × 10¹⁰¹(102-digit number)
15574731285814950659…41925015113887820719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.114 × 10¹⁰¹(102-digit number)
31149462571629901319…83850030227775641439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.229 × 10¹⁰¹(102-digit number)
62298925143259802638…67700060455551282879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.245 × 10¹⁰²(103-digit number)
12459785028651960527…35400120911102565759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.491 × 10¹⁰²(103-digit number)
24919570057303921055…70800241822205131519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.983 × 10¹⁰²(103-digit number)
49839140114607842110…41600483644410263039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.967 × 10¹⁰²(103-digit number)
99678280229215684221…83200967288820526079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.993 × 10¹⁰³(104-digit number)
19935656045843136844…66401934577641052159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.987 × 10¹⁰³(104-digit number)
39871312091686273688…32803869155282104319
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,787,515 XPM·at block #6,817,930 · 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