Block #2,129,300

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/23/2017, 2:39:10 PM · Difficulty 10.9105 · 4,708,013 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2fb82ab991e6de51b26560a196608df71f0ba8d5202f5449c15a57410a3622aa

Height

#2,129,300

Difficulty

10.910512

Transactions

2

Size

426 B

Version

2

Bits

0ae91757

Nonce

1,508,701

Timestamp

5/23/2017, 2:39:10 PM

Confirmations

4,708,013

Merkle Root

3dd018984f4a834b9d003002c28af5e2460969bdc6afcae8681938d9afbcf108
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.

3.422 × 10⁹⁵(96-digit number)
34229128271994416482…10936960039429341761
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
3.422 × 10⁹⁵(96-digit number)
34229128271994416482…10936960039429341761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.845 × 10⁹⁵(96-digit number)
68458256543988832965…21873920078858683521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.369 × 10⁹⁶(97-digit number)
13691651308797766593…43747840157717367041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.738 × 10⁹⁶(97-digit number)
27383302617595533186…87495680315434734081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.476 × 10⁹⁶(97-digit number)
54766605235191066372…74991360630869468161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.095 × 10⁹⁷(98-digit number)
10953321047038213274…49982721261738936321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.190 × 10⁹⁷(98-digit number)
21906642094076426548…99965442523477872641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.381 × 10⁹⁷(98-digit number)
43813284188152853097…99930885046955745281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.762 × 10⁹⁷(98-digit number)
87626568376305706195…99861770093911490561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.752 × 10⁹⁸(99-digit number)
17525313675261141239…99723540187822981121
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,942,822 XPM·at block #6,837,312 · 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