Block #2,826,004

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/5/2018, 3:46:45 PM · Difficulty 11.7099 · 4,016,920 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ed4fae23558500967989396966debb87adc25ae0ed6ce61bb07e097b3b18e1cd

Height

#2,826,004

Difficulty

11.709880

Transactions

7

Size

3.11 KB

Version

2

Bits

0bb5baaa

Nonce

947,137,259

Timestamp

9/5/2018, 3:46:45 PM

Confirmations

4,016,920

Merkle Root

d690db5399448346ac6e3d64beb0d1687e814b12d7654ee92f34b1f2ea649262
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.035 × 10⁹⁷(98-digit number)
10352619968094926961…84913660606922239999
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.035 × 10⁹⁷(98-digit number)
10352619968094926961…84913660606922239999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.070 × 10⁹⁷(98-digit number)
20705239936189853923…69827321213844479999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.141 × 10⁹⁷(98-digit number)
41410479872379707847…39654642427688959999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.282 × 10⁹⁷(98-digit number)
82820959744759415695…79309284855377919999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.656 × 10⁹⁸(99-digit number)
16564191948951883139…58618569710755839999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.312 × 10⁹⁸(99-digit number)
33128383897903766278…17237139421511679999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.625 × 10⁹⁸(99-digit number)
66256767795807532556…34474278843023359999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.325 × 10⁹⁹(100-digit number)
13251353559161506511…68948557686046719999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.650 × 10⁹⁹(100-digit number)
26502707118323013022…37897115372093439999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.300 × 10⁹⁹(100-digit number)
53005414236646026045…75794230744186879999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.060 × 10¹⁰⁰(101-digit number)
10601082847329205209…51588461488373759999
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,987,740 XPM·at block #6,842,923 · 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