Block #521,857

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/2/2014, 5:15:19 PM · Difficulty 10.8642 · 6,290,607 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c96f39acc87d2fe4e3648c79dc8157f24b2062ca93d3d9565d0e8caea19e5ed0

Height

#521,857

Difficulty

10.864150

Transactions

16

Size

4.64 KB

Version

2

Bits

0add38f2

Nonce

152,551,574

Timestamp

5/2/2014, 5:15:19 PM

Confirmations

6,290,607

Merkle Root

b7144dd0ac9f297045de4be39b8fc8f06d37498224e7a50ec6d3aad086bd25fd
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.181 × 10¹⁰⁰(101-digit number)
11817158637209849214…73096130652114636801
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.181 × 10¹⁰⁰(101-digit number)
11817158637209849214…73096130652114636801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.363 × 10¹⁰⁰(101-digit number)
23634317274419698428…46192261304229273601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.726 × 10¹⁰⁰(101-digit number)
47268634548839396856…92384522608458547201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.453 × 10¹⁰⁰(101-digit number)
94537269097678793713…84769045216917094401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.890 × 10¹⁰¹(102-digit number)
18907453819535758742…69538090433834188801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.781 × 10¹⁰¹(102-digit number)
37814907639071517485…39076180867668377601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.562 × 10¹⁰¹(102-digit number)
75629815278143034971…78152361735336755201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.512 × 10¹⁰²(103-digit number)
15125963055628606994…56304723470673510401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.025 × 10¹⁰²(103-digit number)
30251926111257213988…12609446941347020801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.050 × 10¹⁰²(103-digit number)
60503852222514427976…25218893882694041601
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,743,738 XPM·at block #6,812,463 · 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