Block #458,360

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/24/2014, 1:12:47 PM · Difficulty 10.4203 · 6,368,288 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
90a121e2d6d3c54d356d22802e76b4a9a2bbdc5a230c3702163e0f562eaed6e7

Height

#458,360

Difficulty

10.420259

Transactions

9

Size

2.75 KB

Version

2

Bits

0a6b9619

Nonce

27,717

Timestamp

3/24/2014, 1:12:47 PM

Confirmations

6,368,288

Merkle Root

a0e1b62d930fd74ebcc73442988e4380fa7cd82967b695e2b8b4f42724bfe9f8
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.432 × 10⁹²(93-digit number)
74326073555931055646…35144533194264506241
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.432 × 10⁹²(93-digit number)
74326073555931055646…35144533194264506241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.486 × 10⁹³(94-digit number)
14865214711186211129…70289066388529012481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.973 × 10⁹³(94-digit number)
29730429422372422258…40578132777058024961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.946 × 10⁹³(94-digit number)
59460858844744844517…81156265554116049921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.189 × 10⁹⁴(95-digit number)
11892171768948968903…62312531108232099841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.378 × 10⁹⁴(95-digit number)
23784343537897937806…24625062216464199681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.756 × 10⁹⁴(95-digit number)
47568687075795875613…49250124432928399361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.513 × 10⁹⁴(95-digit number)
95137374151591751227…98500248865856798721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.902 × 10⁹⁵(96-digit number)
19027474830318350245…97000497731713597441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.805 × 10⁹⁵(96-digit number)
38054949660636700491…94000995463427194881
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,857,332 XPM·at block #6,826,647 · 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