Block #1,581,130

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/12/2016, 5:11:20 AM · Difficulty 10.6662 · 5,236,562 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5072490122c1547ce8457c7db2b0374b174ee49de5808473b8a9086c601082c9

Height

#1,581,130

Difficulty

10.666190

Transactions

3

Size

2.83 KB

Version

2

Bits

0aaa8b70

Nonce

162,136,064

Timestamp

5/12/2016, 5:11:20 AM

Confirmations

5,236,562

Merkle Root

440cc4488b1f8b308012ceff51891c4ecc1b5723ba6f8c1e48b4a9fca9900494
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.054 × 10⁹⁵(96-digit number)
20540710345303054554…51129431019030856961
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.054 × 10⁹⁵(96-digit number)
20540710345303054554…51129431019030856961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.108 × 10⁹⁵(96-digit number)
41081420690606109109…02258862038061713921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.216 × 10⁹⁵(96-digit number)
82162841381212218219…04517724076123427841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.643 × 10⁹⁶(97-digit number)
16432568276242443643…09035448152246855681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.286 × 10⁹⁶(97-digit number)
32865136552484887287…18070896304493711361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.573 × 10⁹⁶(97-digit number)
65730273104969774575…36141792608987422721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.314 × 10⁹⁷(98-digit number)
13146054620993954915…72283585217974845441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.629 × 10⁹⁷(98-digit number)
26292109241987909830…44567170435949690881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.258 × 10⁹⁷(98-digit number)
52584218483975819660…89134340871899381761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.051 × 10⁹⁸(99-digit number)
10516843696795163932…78268681743798763521
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,785,594 XPM·at block #6,817,691 · 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