Block #1,826,075

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 10/27/2016, 10:17:27 PM · Difficulty 10.7825 · 5,001,159 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1ce4d869bf929edacbf7c62e99e15c7b89f18aad65c727d421779f5fba8e2e8a

Height

#1,826,075

Difficulty

10.782479

Transactions

1

Size

243 B

Version

2

Bits

0ac85085

Nonce

459,998,752

Timestamp

10/27/2016, 10:17:27 PM

Confirmations

5,001,159

Merkle Root

4379266c4de6db50727955908b121702c67cfd16d01e0acc3acf97540fd4e1de
Transactions (1)
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.

8.759 × 10⁹⁵(96-digit number)
87590261355108785803…13682044376617707201
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
8.759 × 10⁹⁵(96-digit number)
87590261355108785803…13682044376617707201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.751 × 10⁹⁶(97-digit number)
17518052271021757160…27364088753235414401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.503 × 10⁹⁶(97-digit number)
35036104542043514321…54728177506470828801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.007 × 10⁹⁶(97-digit number)
70072209084087028642…09456355012941657601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.401 × 10⁹⁷(98-digit number)
14014441816817405728…18912710025883315201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.802 × 10⁹⁷(98-digit number)
28028883633634811457…37825420051766630401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.605 × 10⁹⁷(98-digit number)
56057767267269622914…75650840103533260801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.121 × 10⁹⁸(99-digit number)
11211553453453924582…51301680207066521601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.242 × 10⁹⁸(99-digit number)
22423106906907849165…02603360414133043201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.484 × 10⁹⁸(99-digit number)
44846213813815698331…05206720828266086401
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,861,972 XPM·at block #6,827,233 · 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