Block #459,556

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/25/2014, 9:45:31 AM · Difficulty 10.4177 · 6,357,934 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
47ac2617b4bbbcf80c55c0f0ca06fbe2a7c1ce74737905a1cdad684e3b751258

Height

#459,556

Difficulty

10.417683

Transactions

1

Size

1005 B

Version

2

Bits

0a6aed42

Nonce

134,691

Timestamp

3/25/2014, 9:45:31 AM

Confirmations

6,357,934

Merkle Root

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

2.659 × 10⁹⁸(99-digit number)
26596179531852278021…10819288966064897281
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
2.659 × 10⁹⁸(99-digit number)
26596179531852278021…10819288966064897281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.319 × 10⁹⁸(99-digit number)
53192359063704556043…21638577932129794561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.063 × 10⁹⁹(100-digit number)
10638471812740911208…43277155864259589121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.127 × 10⁹⁹(100-digit number)
21276943625481822417…86554311728519178241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.255 × 10⁹⁹(100-digit number)
42553887250963644834…73108623457038356481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.510 × 10⁹⁹(100-digit number)
85107774501927289669…46217246914076712961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.702 × 10¹⁰⁰(101-digit number)
17021554900385457933…92434493828153425921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.404 × 10¹⁰⁰(101-digit number)
34043109800770915867…84868987656306851841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.808 × 10¹⁰⁰(101-digit number)
68086219601541831735…69737975312613703681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.361 × 10¹⁰¹(102-digit number)
13617243920308366347…39475950625227407361
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,783,967 XPM·at block #6,817,489 · 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