Block #458,404

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/24/2014, 1:57:28 PM · Difficulty 10.4202 · 6,356,407 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
498afc0a6476f5a8e505b039b1ddfba6fc6fefa1cc5b7109e18e3ec9c84dbe82

Height

#458,404

Difficulty

10.420179

Transactions

5

Size

1.08 KB

Version

2

Bits

0a6b90dc

Nonce

53,306,984

Timestamp

3/24/2014, 1:57:28 PM

Confirmations

6,356,407

Merkle Root

52dee26de890d5be509c1296039dbdbec5a33331768aa4c3e7a82fbb47a12ee2
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.665 × 10⁹³(94-digit number)
16651401843593529938…32892127227091734441
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.665 × 10⁹³(94-digit number)
16651401843593529938…32892127227091734441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.330 × 10⁹³(94-digit number)
33302803687187059876…65784254454183468881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.660 × 10⁹³(94-digit number)
66605607374374119753…31568508908366937761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.332 × 10⁹⁴(95-digit number)
13321121474874823950…63137017816733875521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.664 × 10⁹⁴(95-digit number)
26642242949749647901…26274035633467751041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.328 × 10⁹⁴(95-digit number)
53284485899499295802…52548071266935502081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.065 × 10⁹⁵(96-digit number)
10656897179899859160…05096142533871004161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.131 × 10⁹⁵(96-digit number)
21313794359799718320…10192285067742008321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.262 × 10⁹⁵(96-digit number)
42627588719599436641…20384570135484016641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.525 × 10⁹⁵(96-digit number)
85255177439198873283…40769140270968033281
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,762,574 XPM·at block #6,814,810 · 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