Block #214,545

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/17/2013, 1:37:16 PM · Difficulty 9.9234 · 6,593,593 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
13d5271e92fa70167e69b0920d9e94659b615b56397f86020006f4b162618e9d

Height

#214,545

Difficulty

9.923377

Transactions

1

Size

5.59 KB

Version

2

Bits

09ec6269

Nonce

1,164,800,502

Timestamp

10/17/2013, 1:37:16 PM

Confirmations

6,593,593

Merkle Root

3473705ed8f7304e61cb17d955b800fe7b8134bba5cf2fc341f26d0d45715995
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.

4.078 × 10⁹⁷(98-digit number)
40783965569070534713…52003385197569950721
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
4.078 × 10⁹⁷(98-digit number)
40783965569070534713…52003385197569950721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.156 × 10⁹⁷(98-digit number)
81567931138141069426…04006770395139901441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.631 × 10⁹⁸(99-digit number)
16313586227628213885…08013540790279802881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.262 × 10⁹⁸(99-digit number)
32627172455256427770…16027081580559605761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.525 × 10⁹⁸(99-digit number)
65254344910512855540…32054163161119211521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.305 × 10⁹⁹(100-digit number)
13050868982102571108…64108326322238423041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.610 × 10⁹⁹(100-digit number)
26101737964205142216…28216652644476846081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.220 × 10⁹⁹(100-digit number)
52203475928410284432…56433305288953692161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.044 × 10¹⁰⁰(101-digit number)
10440695185682056886…12866610577907384321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.088 × 10¹⁰⁰(101-digit number)
20881390371364113773…25733221155814768641
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,709,146 XPM·at block #6,808,137 · 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