Block #501,747

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/19/2014, 11:55:03 PM · Difficulty 10.8045 · 6,322,842 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5ed8cb969ac13be3de0026894c03f802dbb2198eb593d799f7f10099711fb094

Height

#501,747

Difficulty

10.804517

Transactions

3

Size

1021 B

Version

2

Bits

0acdf4cd

Nonce

296,080,554

Timestamp

4/19/2014, 11:55:03 PM

Confirmations

6,322,842

Merkle Root

5ac8f11d1da78e6521f45afbb36186e41fbdfbe6b638df1fa9939fbd0f4c9111
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.

2.628 × 10⁹⁸(99-digit number)
26287793449390297219…06094020274686053121
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
2.628 × 10⁹⁸(99-digit number)
26287793449390297219…06094020274686053121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.257 × 10⁹⁸(99-digit number)
52575586898780594439…12188040549372106241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.051 × 10⁹⁹(100-digit number)
10515117379756118887…24376081098744212481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.103 × 10⁹⁹(100-digit number)
21030234759512237775…48752162197488424961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.206 × 10⁹⁹(100-digit number)
42060469519024475551…97504324394976849921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.412 × 10⁹⁹(100-digit number)
84120939038048951102…95008648789953699841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.682 × 10¹⁰⁰(101-digit number)
16824187807609790220…90017297579907399681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.364 × 10¹⁰⁰(101-digit number)
33648375615219580441…80034595159814799361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.729 × 10¹⁰⁰(101-digit number)
67296751230439160882…60069190319629598721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.345 × 10¹⁰¹(102-digit number)
13459350246087832176…20138380639259197441
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,840,780 XPM·at block #6,824,588 · 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