Block #457,364

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/23/2014, 8:36:24 PM · Difficulty 10.4202 · 6,353,016 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e0a9c1668ca5c28d853f10a4abb5d3a5e80b70275b4744dcd27f35357c27e026

Height

#457,364

Difficulty

10.420245

Transactions

5

Size

1.94 KB

Version

2

Bits

0a6b9528

Nonce

214,841

Timestamp

3/23/2014, 8:36:24 PM

Confirmations

6,353,016

Merkle Root

6f73e24184cc6fa76a83f99ee64605f9fab5d72a6e1760cbb1f3986da4f38ac1
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.310 × 10⁹⁴(95-digit number)
13104661858017493675…53919224152851448241
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.310 × 10⁹⁴(95-digit number)
13104661858017493675…53919224152851448241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.620 × 10⁹⁴(95-digit number)
26209323716034987350…07838448305702896481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.241 × 10⁹⁴(95-digit number)
52418647432069974701…15676896611405792961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.048 × 10⁹⁵(96-digit number)
10483729486413994940…31353793222811585921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.096 × 10⁹⁵(96-digit number)
20967458972827989880…62707586445623171841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.193 × 10⁹⁵(96-digit number)
41934917945655979760…25415172891246343681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.386 × 10⁹⁵(96-digit number)
83869835891311959521…50830345782492687361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.677 × 10⁹⁶(97-digit number)
16773967178262391904…01660691564985374721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.354 × 10⁹⁶(97-digit number)
33547934356524783808…03321383129970749441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.709 × 10⁹⁶(97-digit number)
67095868713049567617…06642766259941498881
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,117 XPM·at block #6,810,379 · 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