Block #500,389

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/19/2014, 3:19:08 AM · Difficulty 10.7997 · 6,326,810 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9c2b6af35faf26ed073b5d2206b17ed6bf339dcd4a4091ac03723d8c2bb29ef9

Height

#500,389

Difficulty

10.799651

Transactions

9

Size

2.13 KB

Version

2

Bits

0accb5f2

Nonce

851

Timestamp

4/19/2014, 3:19:08 AM

Confirmations

6,326,810

Merkle Root

ddf4953ddd5f14f6a0814440cbbe3693474b26935cc947d8bd5cf0a48eff3dfc
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.726 × 10¹⁰⁰(101-digit number)
17265451070654595707…04270314590303237121
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.726 × 10¹⁰⁰(101-digit number)
17265451070654595707…04270314590303237121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.453 × 10¹⁰⁰(101-digit number)
34530902141309191414…08540629180606474241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.906 × 10¹⁰⁰(101-digit number)
69061804282618382829…17081258361212948481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.381 × 10¹⁰¹(102-digit number)
13812360856523676565…34162516722425896961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.762 × 10¹⁰¹(102-digit number)
27624721713047353131…68325033444851793921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.524 × 10¹⁰¹(102-digit number)
55249443426094706263…36650066889703587841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.104 × 10¹⁰²(103-digit number)
11049888685218941252…73300133779407175681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.209 × 10¹⁰²(103-digit number)
22099777370437882505…46600267558814351361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.419 × 10¹⁰²(103-digit number)
44199554740875765010…93200535117628702721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.839 × 10¹⁰²(103-digit number)
88399109481751530021…86401070235257405441
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,861,689 XPM·at block #6,827,198 · 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