Block #513,291

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/27/2014, 10:44:14 AM · Difficulty 10.8347 · 6,297,605 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ada76a5e350acc02fa03abd18ee4b06e80648cc149466ed391aedb7a918da5e0

Height

#513,291

Difficulty

10.834684

Transactions

8

Size

4.93 KB

Version

2

Bits

0ad5add4

Nonce

37,824,122

Timestamp

4/27/2014, 10:44:14 AM

Confirmations

6,297,605

Merkle Root

3e2d4fa6387a2f458a9209534019408ba3e2cca61d2424d5a5445e11d4afb53f
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.

8.716 × 10⁹⁸(99-digit number)
87167553520609321517…45639780467026763521
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
8.716 × 10⁹⁸(99-digit number)
87167553520609321517…45639780467026763521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.743 × 10⁹⁹(100-digit number)
17433510704121864303…91279560934053527041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.486 × 10⁹⁹(100-digit number)
34867021408243728607…82559121868107054081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.973 × 10⁹⁹(100-digit number)
69734042816487457214…65118243736214108161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.394 × 10¹⁰⁰(101-digit number)
13946808563297491442…30236487472428216321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.789 × 10¹⁰⁰(101-digit number)
27893617126594982885…60472974944856432641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.578 × 10¹⁰⁰(101-digit number)
55787234253189965771…20945949889712865281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.115 × 10¹⁰¹(102-digit number)
11157446850637993154…41891899779425730561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.231 × 10¹⁰¹(102-digit number)
22314893701275986308…83783799558851461121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.462 × 10¹⁰¹(102-digit number)
44629787402551972617…67567599117702922241
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,731,266 XPM·at block #6,810,895 · 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