Block #458,879

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/24/2014, 10:03:24 PM · Difficulty 10.4200 · 6,351,496 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ed6cfde8777f27d78a69efe64a9df149380bbdfbbed191d14dd49ce3e3b4b12c

Height

#458,879

Difficulty

10.419993

Transactions

5

Size

1.19 KB

Version

2

Bits

0a6b84a6

Nonce

185,053

Timestamp

3/24/2014, 10:03:24 PM

Confirmations

6,351,496

Merkle Root

d49189d3867b846e01380a11eccd6aa444d2a1206a8fe3228c15d485a2c7f3e0
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.061 × 10¹⁰⁰(101-digit number)
10615336813722006074…92340764789193707621
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.061 × 10¹⁰⁰(101-digit number)
10615336813722006074…92340764789193707621
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.123 × 10¹⁰⁰(101-digit number)
21230673627444012149…84681529578387415241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.246 × 10¹⁰⁰(101-digit number)
42461347254888024299…69363059156774830481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.492 × 10¹⁰⁰(101-digit number)
84922694509776048599…38726118313549660961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.698 × 10¹⁰¹(102-digit number)
16984538901955209719…77452236627099321921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.396 × 10¹⁰¹(102-digit number)
33969077803910419439…54904473254198643841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.793 × 10¹⁰¹(102-digit number)
67938155607820838879…09808946508397287681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.358 × 10¹⁰²(103-digit number)
13587631121564167775…19617893016794575361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.717 × 10¹⁰²(103-digit number)
27175262243128335551…39235786033589150721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.435 × 10¹⁰²(103-digit number)
54350524486256671103…78471572067178301441
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,727,076 XPM·at block #6,810,374 · 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