Block #1,852,259

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/16/2016, 11:05:12 PM · Difficulty 10.6328 · 4,981,063 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5927debabaacfaf1a4db7f0cd86d43d4c1ef49c3c91a559250e6533069c2212b

Height

#1,852,259

Difficulty

10.632849

Transactions

4

Size

2.64 KB

Version

2

Bits

0aa20266

Nonce

1,589,723,318

Timestamp

11/16/2016, 11:05:12 PM

Confirmations

4,981,063

Merkle Root

9b28b5567fcd0367ce32e949a5cd3623dd774b7d8f29bfb49aa2b6af5e58a1ac
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.

7.385 × 10⁹⁷(98-digit number)
73851019808522849180…26166417325303152639
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
7.385 × 10⁹⁷(98-digit number)
73851019808522849180…26166417325303152639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.477 × 10⁹⁸(99-digit number)
14770203961704569836…52332834650606305279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.954 × 10⁹⁸(99-digit number)
29540407923409139672…04665669301212610559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.908 × 10⁹⁸(99-digit number)
59080815846818279344…09331338602425221119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.181 × 10⁹⁹(100-digit number)
11816163169363655868…18662677204850442239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.363 × 10⁹⁹(100-digit number)
23632326338727311737…37325354409700884479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.726 × 10⁹⁹(100-digit number)
47264652677454623475…74650708819401768959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.452 × 10⁹⁹(100-digit number)
94529305354909246951…49301417638803537919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.890 × 10¹⁰⁰(101-digit number)
18905861070981849390…98602835277607075839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.781 × 10¹⁰⁰(101-digit number)
37811722141963698780…97205670555214151679
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,910,769 XPM·at block #6,833,321 · 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