Block #458,966

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/24/2014, 11:36:43 PM · Difficulty 10.4199 · 6,348,962 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
061da24ca0ff359217a988e2361af2648c6b4c01483bb5c461d6d145dd7db6e8

Height

#458,966

Difficulty

10.419919

Transactions

6

Size

2.45 KB

Version

2

Bits

0a6b7fca

Nonce

1,240,701

Timestamp

3/24/2014, 11:36:43 PM

Confirmations

6,348,962

Merkle Root

3aa650e9abd70eba050d55e1c17c2369118f74f5193a77e823ff80863f722bbe
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.

8.615 × 10⁹³(94-digit number)
86153847196586837756…64782183344373186561
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
8.615 × 10⁹³(94-digit number)
86153847196586837756…64782183344373186561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.723 × 10⁹⁴(95-digit number)
17230769439317367551…29564366688746373121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.446 × 10⁹⁴(95-digit number)
34461538878634735102…59128733377492746241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.892 × 10⁹⁴(95-digit number)
68923077757269470205…18257466754985492481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.378 × 10⁹⁵(96-digit number)
13784615551453894041…36514933509970984961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.756 × 10⁹⁵(96-digit number)
27569231102907788082…73029867019941969921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.513 × 10⁹⁵(96-digit number)
55138462205815576164…46059734039883939841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.102 × 10⁹⁶(97-digit number)
11027692441163115232…92119468079767879681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.205 × 10⁹⁶(97-digit number)
22055384882326230465…84238936159535759361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.411 × 10⁹⁶(97-digit number)
44110769764652460931…68477872319071518721
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,707,461 XPM·at block #6,807,927 · 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