Block #512,987

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/27/2014, 5:48:53 AM · Difficulty 10.8343 · 6,304,080 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9ad20ab7b51aa730a523ef0ace2d673749480d1d48cc2f5db2784ca76bd20d19

Height

#512,987

Difficulty

10.834270

Transactions

13

Size

2.84 KB

Version

2

Bits

0ad592b0

Nonce

90,035

Timestamp

4/27/2014, 5:48:53 AM

Confirmations

6,304,080

Merkle Root

e2791bf57167fd10243eb92d73a5efa9cca0813ed652e633ed7fdfa90bb72d45
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.159 × 10¹⁰⁰(101-digit number)
11598292663263010372…24108998676779746721
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.159 × 10¹⁰⁰(101-digit number)
11598292663263010372…24108998676779746721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.319 × 10¹⁰⁰(101-digit number)
23196585326526020745…48217997353559493441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.639 × 10¹⁰⁰(101-digit number)
46393170653052041491…96435994707118986881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.278 × 10¹⁰⁰(101-digit number)
92786341306104082982…92871989414237973761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.855 × 10¹⁰¹(102-digit number)
18557268261220816596…85743978828475947521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.711 × 10¹⁰¹(102-digit number)
37114536522441633193…71487957656951895041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.422 × 10¹⁰¹(102-digit number)
74229073044883266386…42975915313903790081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.484 × 10¹⁰²(103-digit number)
14845814608976653277…85951830627807580161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.969 × 10¹⁰²(103-digit number)
29691629217953306554…71903661255615160321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.938 × 10¹⁰²(103-digit number)
59383258435906613109…43807322511230320641
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,780,571 XPM·at block #6,817,066 · 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