Block #458,024

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/24/2014, 7:36:20 AM · Difficulty 10.4202 · 6,349,125 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
dc4d83cbe5e26ca4a2153600046c7d50909fcdb1518cd77a24c841f044cc3bca

Height

#458,024

Difficulty

10.420237

Transactions

11

Size

20.26 KB

Version

2

Bits

0a6b94ac

Nonce

46,310

Timestamp

3/24/2014, 7:36:20 AM

Confirmations

6,349,125

Merkle Root

5d055e0ae3998f70fa4beecacf357693909082ca1d0e8b4f06dfe64595bdc73e
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.835 × 10⁹⁹(100-digit number)
78356942596576428943…16806657250128276479
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.835 × 10⁹⁹(100-digit number)
78356942596576428943…16806657250128276479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.567 × 10¹⁰⁰(101-digit number)
15671388519315285788…33613314500256552959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.134 × 10¹⁰⁰(101-digit number)
31342777038630571577…67226629000513105919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.268 × 10¹⁰⁰(101-digit number)
62685554077261143154…34453258001026211839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.253 × 10¹⁰¹(102-digit number)
12537110815452228630…68906516002052423679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.507 × 10¹⁰¹(102-digit number)
25074221630904457261…37813032004104847359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.014 × 10¹⁰¹(102-digit number)
50148443261808914523…75626064008209694719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.002 × 10¹⁰²(103-digit number)
10029688652361782904…51252128016419389439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.005 × 10¹⁰²(103-digit number)
20059377304723565809…02504256032838778879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.011 × 10¹⁰²(103-digit number)
40118754609447131618…05008512065677557759
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,701,198 XPM·at block #6,807,148 · 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