Block #2,129,415

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/23/2017, 4:41:16 PM · Difficulty 10.9104 · 4,710,460 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a18ce78835c540dbe77470e72d5e8542aff8230f56cafec15e2c759ae95c645e

Height

#2,129,415

Difficulty

10.910409

Transactions

2

Size

426 B

Version

2

Bits

0ae91095

Nonce

594,207,889

Timestamp

5/23/2017, 4:41:16 PM

Confirmations

4,710,460

Merkle Root

f87f239fc6f3ec8c6138b04de731030e8e8551e9497a78f3d29180d5df3049bb
Transactions (2)
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.

6.156 × 10⁹⁵(96-digit number)
61568522887299940641…17341549225468139521
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
6.156 × 10⁹⁵(96-digit number)
61568522887299940641…17341549225468139521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.231 × 10⁹⁶(97-digit number)
12313704577459988128…34683098450936279041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.462 × 10⁹⁶(97-digit number)
24627409154919976256…69366196901872558081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.925 × 10⁹⁶(97-digit number)
49254818309839952513…38732393803745116161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.850 × 10⁹⁶(97-digit number)
98509636619679905026…77464787607490232321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.970 × 10⁹⁷(98-digit number)
19701927323935981005…54929575214980464641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.940 × 10⁹⁷(98-digit number)
39403854647871962010…09859150429960929281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.880 × 10⁹⁷(98-digit number)
78807709295743924020…19718300859921858561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.576 × 10⁹⁸(99-digit number)
15761541859148784804…39436601719843717121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.152 × 10⁹⁸(99-digit number)
31523083718297569608…78873203439687434241
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,963,301 XPM·at block #6,839,874 · 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