Block #2,128,345

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/22/2017, 6:17:20 PM · Difficulty 10.9152 · 4,697,218 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b8d488e6d1b210e4e4f98be52c8a502d4f3214c65292c7ae34479c2569cdf3b9

Height

#2,128,345

Difficulty

10.915178

Transactions

8

Size

4.79 KB

Version

2

Bits

0aea491c

Nonce

274,905,977

Timestamp

5/22/2017, 6:17:20 PM

Confirmations

4,697,218

Merkle Root

ab3fe88adda3d2c7cbbf5fcc9b8c6c037bdc2a74d30217014fdcf3a7ab25c1e0
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.

7.962 × 10⁹⁶(97-digit number)
79629217995729219759…18291003577527403521
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
7.962 × 10⁹⁶(97-digit number)
79629217995729219759…18291003577527403521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.592 × 10⁹⁷(98-digit number)
15925843599145843951…36582007155054807041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.185 × 10⁹⁷(98-digit number)
31851687198291687903…73164014310109614081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.370 × 10⁹⁷(98-digit number)
63703374396583375807…46328028620219228161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.274 × 10⁹⁸(99-digit number)
12740674879316675161…92656057240438456321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.548 × 10⁹⁸(99-digit number)
25481349758633350322…85312114480876912641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.096 × 10⁹⁸(99-digit number)
50962699517266700645…70624228961753825281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.019 × 10⁹⁹(100-digit number)
10192539903453340129…41248457923507650561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.038 × 10⁹⁹(100-digit number)
20385079806906680258…82496915847015301121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.077 × 10⁹⁹(100-digit number)
40770159613813360516…64993831694030602241
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,848,605 XPM·at block #6,825,562 · 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