Block #1,281,459

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/14/2015, 9:06:50 AM · Difficulty 10.8390 · 5,528,514 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c8f2159fb526d4292d55bdb98cb39ed2048173bb60aa429e93879d3c1f121b32

Height

#1,281,459

Difficulty

10.839043

Transactions

3

Size

18.72 KB

Version

2

Bits

0ad6cb83

Nonce

204,788,844

Timestamp

10/14/2015, 9:06:50 AM

Confirmations

5,528,514

Merkle Root

366de1132cc10e6a3158ab763ba20130be63d88be303abd16877dd8044378d2b
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.

4.604 × 10⁹⁴(95-digit number)
46049229855391929797…54286768421127857601
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
4.604 × 10⁹⁴(95-digit number)
46049229855391929797…54286768421127857601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.209 × 10⁹⁴(95-digit number)
92098459710783859594…08573536842255715201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.841 × 10⁹⁵(96-digit number)
18419691942156771918…17147073684511430401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.683 × 10⁹⁵(96-digit number)
36839383884313543837…34294147369022860801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.367 × 10⁹⁵(96-digit number)
73678767768627087675…68588294738045721601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.473 × 10⁹⁶(97-digit number)
14735753553725417535…37176589476091443201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.947 × 10⁹⁶(97-digit number)
29471507107450835070…74353178952182886401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.894 × 10⁹⁶(97-digit number)
58943014214901670140…48706357904365772801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.178 × 10⁹⁷(98-digit number)
11788602842980334028…97412715808731545601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.357 × 10⁹⁷(98-digit number)
23577205685960668056…94825431617463091201
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,723,858 XPM·at block #6,809,972 · 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