Block #512,808

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/27/2014, 2:55:12 AM · Difficulty 10.8341 · 6,303,398 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d2fd10d53e60dba4fd2dd7744fca37e4d6bd669d73b6a8033c7aed0104e099ea

Height

#512,808

Difficulty

10.834115

Transactions

5

Size

7.70 KB

Version

2

Bits

0ad5888c

Nonce

80,037,302

Timestamp

4/27/2014, 2:55:12 AM

Confirmations

6,303,398

Merkle Root

4ce0b8dacb44072a098e073813895d54f03a120ddc5908dd139acd8170f68cff
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.077 × 10⁹⁸(99-digit number)
10776112030622905259…42516465021755903601
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.077 × 10⁹⁸(99-digit number)
10776112030622905259…42516465021755903601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.155 × 10⁹⁸(99-digit number)
21552224061245810519…85032930043511807201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.310 × 10⁹⁸(99-digit number)
43104448122491621039…70065860087023614401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.620 × 10⁹⁸(99-digit number)
86208896244983242078…40131720174047228801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.724 × 10⁹⁹(100-digit number)
17241779248996648415…80263440348094457601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.448 × 10⁹⁹(100-digit number)
34483558497993296831…60526880696188915201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.896 × 10⁹⁹(100-digit number)
68967116995986593662…21053761392377830401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.379 × 10¹⁰⁰(101-digit number)
13793423399197318732…42107522784755660801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.758 × 10¹⁰⁰(101-digit number)
27586846798394637464…84215045569511321601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.517 × 10¹⁰⁰(101-digit number)
55173693596789274929…68430091139022643201
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,773,775 XPM·at block #6,816,205 · 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