Block #458,394

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/24/2014, 1:48:49 PM · Difficulty 10.4201 · 6,359,630 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0086a05604fff36912d1368c6d2c4e54b52610f7a4a09296b4dfba9b1d4a0276

Height

#458,394

Difficulty

10.420150

Transactions

4

Size

1.21 KB

Version

2

Bits

0a6b8ef3

Nonce

42,612,718

Timestamp

3/24/2014, 1:48:49 PM

Confirmations

6,359,630

Merkle Root

be0b521093a2e942800b100229e33259d42e525c5e6efefdbbe64b35016375b0
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.047 × 10⁹⁵(96-digit number)
10478569579639413674…79024292626985126401
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.047 × 10⁹⁵(96-digit number)
10478569579639413674…79024292626985126401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.095 × 10⁹⁵(96-digit number)
20957139159278827348…58048585253970252801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.191 × 10⁹⁵(96-digit number)
41914278318557654696…16097170507940505601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.382 × 10⁹⁵(96-digit number)
83828556637115309392…32194341015881011201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.676 × 10⁹⁶(97-digit number)
16765711327423061878…64388682031762022401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.353 × 10⁹⁶(97-digit number)
33531422654846123756…28777364063524044801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.706 × 10⁹⁶(97-digit number)
67062845309692247513…57554728127048089601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.341 × 10⁹⁷(98-digit number)
13412569061938449502…15109456254096179201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.682 × 10⁹⁷(98-digit number)
26825138123876899005…30218912508192358401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.365 × 10⁹⁷(98-digit number)
53650276247753798010…60437825016384716801
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,788,260 XPM·at block #6,818,023 · 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