Block #2,178,354

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/26/2017, 1:43:13 AM · Difficulty 10.9259 · 4,660,278 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e525dc982e7e0b08334981c46e2c92d0d0d889fe9215ca81f82e7131108a73f2

Height

#2,178,354

Difficulty

10.925851

Transactions

5

Size

1.01 KB

Version

2

Bits

0aed0491

Nonce

504,855,920

Timestamp

6/26/2017, 1:43:13 AM

Confirmations

4,660,278

Merkle Root

dedaed0fe9b471d233f7a09e8df1030b7c82dcf824730e751a8bb8d644ff47c1
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.306 × 10⁹⁴(95-digit number)
23060361201238620453…58572252048786533319
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.306 × 10⁹⁴(95-digit number)
23060361201238620453…58572252048786533319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.612 × 10⁹⁴(95-digit number)
46120722402477240907…17144504097573066639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.224 × 10⁹⁴(95-digit number)
92241444804954481815…34289008195146133279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.844 × 10⁹⁵(96-digit number)
18448288960990896363…68578016390292266559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.689 × 10⁹⁵(96-digit number)
36896577921981792726…37156032780584533119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.379 × 10⁹⁵(96-digit number)
73793155843963585452…74312065561169066239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.475 × 10⁹⁶(97-digit number)
14758631168792717090…48624131122338132479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.951 × 10⁹⁶(97-digit number)
29517262337585434181…97248262244676264959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.903 × 10⁹⁶(97-digit number)
59034524675170868362…94496524489352529919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.180 × 10⁹⁷(98-digit number)
11806904935034173672…88993048978705059839
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,953,319 XPM·at block #6,838,631 · 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