Block #1,835,509

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/4/2016, 9:38:48 PM · Difficulty 10.6742 · 4,981,220 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3134aff8855da5f5b553c6878ac32b675f0ef12181a03fd04809ac390baf7b0e

Height

#1,835,509

Difficulty

10.674220

Transactions

4

Size

5.62 KB

Version

2

Bits

0aac99b4

Nonce

1,842,388,975

Timestamp

11/4/2016, 9:38:48 PM

Confirmations

4,981,220

Merkle Root

3934557e1f244b785017344690e0311353d73e7ee4ac80df82e28f699130326d
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.092 × 10⁹⁴(95-digit number)
20928794233001515293…37149064467793889559
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.092 × 10⁹⁴(95-digit number)
20928794233001515293…37149064467793889559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.185 × 10⁹⁴(95-digit number)
41857588466003030587…74298128935587779119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.371 × 10⁹⁴(95-digit number)
83715176932006061175…48596257871175558239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.674 × 10⁹⁵(96-digit number)
16743035386401212235…97192515742351116479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.348 × 10⁹⁵(96-digit number)
33486070772802424470…94385031484702232959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.697 × 10⁹⁵(96-digit number)
66972141545604848940…88770062969404465919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.339 × 10⁹⁶(97-digit number)
13394428309120969788…77540125938808931839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.678 × 10⁹⁶(97-digit number)
26788856618241939576…55080251877617863679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.357 × 10⁹⁶(97-digit number)
53577713236483879152…10160503755235727359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.071 × 10⁹⁷(98-digit number)
10715542647296775830…20321007510471454719
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,777,867 XPM·at block #6,816,728 · 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