Block #458,167

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/24/2014, 9:54:35 AM · Difficulty 10.4211 · 6,350,393 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e890fe6997fd1bfe08c435fd840ef37565703995e8c7533d3bfaa096ab345a44

Height

#458,167

Difficulty

10.421058

Transactions

7

Size

1.57 KB

Version

2

Bits

0a6bca77

Nonce

738,501

Timestamp

3/24/2014, 9:54:35 AM

Confirmations

6,350,393

Merkle Root

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

5.149 × 10⁹³(94-digit number)
51493341062177466718…87008851608334000001
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
5.149 × 10⁹³(94-digit number)
51493341062177466718…87008851608334000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.029 × 10⁹⁴(95-digit number)
10298668212435493343…74017703216668000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.059 × 10⁹⁴(95-digit number)
20597336424870986687…48035406433336000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.119 × 10⁹⁴(95-digit number)
41194672849741973374…96070812866672000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.238 × 10⁹⁴(95-digit number)
82389345699483946748…92141625733344000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.647 × 10⁹⁵(96-digit number)
16477869139896789349…84283251466688000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.295 × 10⁹⁵(96-digit number)
32955738279793578699…68566502933376000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.591 × 10⁹⁵(96-digit number)
65911476559587157399…37133005866752000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.318 × 10⁹⁶(97-digit number)
13182295311917431479…74266011733504000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.636 × 10⁹⁶(97-digit number)
26364590623834862959…48532023467008000001
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,712,538 XPM·at block #6,808,559 · 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