Block #219,783

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/20/2013, 4:40:34 PM · Difficulty 9.9341 · 6,597,012 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e14814d004960400543677e0512f867c75b38d8a4467d95a2789e8a72cfbbc75

Height

#219,783

Difficulty

9.934098

Transactions

3

Size

1019 B

Version

2

Bits

09ef210c

Nonce

150,843

Timestamp

10/20/2013, 4:40:34 PM

Confirmations

6,597,012

Merkle Root

6a183e2728d1d2e589ba443e98425c68ee43c15d1257bebda658333d01bf8c30
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.120 × 10⁹⁹(100-digit number)
11204859540603168042…96926936199359272961
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.120 × 10⁹⁹(100-digit number)
11204859540603168042…96926936199359272961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.240 × 10⁹⁹(100-digit number)
22409719081206336085…93853872398718545921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.481 × 10⁹⁹(100-digit number)
44819438162412672170…87707744797437091841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.963 × 10⁹⁹(100-digit number)
89638876324825344340…75415489594874183681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.792 × 10¹⁰⁰(101-digit number)
17927775264965068868…50830979189748367361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.585 × 10¹⁰⁰(101-digit number)
35855550529930137736…01661958379496734721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.171 × 10¹⁰⁰(101-digit number)
71711101059860275472…03323916758993469441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.434 × 10¹⁰¹(102-digit number)
14342220211972055094…06647833517986938881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.868 × 10¹⁰¹(102-digit number)
28684440423944110188…13295667035973877761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.736 × 10¹⁰¹(102-digit number)
57368880847888220377…26591334071947755521
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,778,397 XPM·at block #6,816,794 · 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