Block #458,561

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/24/2014, 4:35:26 PM · Difficulty 10.4206 · 6,353,786 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d720b34eda7d8a794a99602fb6cc1bc4f0d0141718d3cb568cfa4c1f49faa179

Height

#458,561

Difficulty

10.420618

Transactions

3

Size

1.28 KB

Version

2

Bits

0a6bad9a

Nonce

187,784

Timestamp

3/24/2014, 4:35:26 PM

Confirmations

6,353,786

Merkle Root

f169e2116a38edb4cc755207bf638d29fc2b7ce8e4cc7a015be4170f2f9841e0
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.

2.534 × 10⁹⁹(100-digit number)
25342181585949834074…38049196049269432001
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
2.534 × 10⁹⁹(100-digit number)
25342181585949834074…38049196049269432001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.068 × 10⁹⁹(100-digit number)
50684363171899668149…76098392098538864001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.013 × 10¹⁰⁰(101-digit number)
10136872634379933629…52196784197077728001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.027 × 10¹⁰⁰(101-digit number)
20273745268759867259…04393568394155456001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.054 × 10¹⁰⁰(101-digit number)
40547490537519734519…08787136788310912001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.109 × 10¹⁰⁰(101-digit number)
81094981075039469039…17574273576621824001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.621 × 10¹⁰¹(102-digit number)
16218996215007893807…35148547153243648001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.243 × 10¹⁰¹(102-digit number)
32437992430015787615…70297094306487296001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.487 × 10¹⁰¹(102-digit number)
64875984860031575231…40594188612974592001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.297 × 10¹⁰²(103-digit number)
12975196972006315046…81188377225949184001
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,742,796 XPM·at block #6,812,346 · 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