Block #2,131,351

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/25/2017, 1:17:48 AM · Difficulty 10.9101 · 4,711,079 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
286b95a0dbfc2a0f5493d7b0d2d11173e04112a0286145e7ab55308aae344a66

Height

#2,131,351

Difficulty

10.910107

Transactions

2

Size

426 B

Version

2

Bits

0ae8fcbe

Nonce

2,041,648,228

Timestamp

5/25/2017, 1:17:48 AM

Confirmations

4,711,079

Merkle Root

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

8.799 × 10⁹³(94-digit number)
87990008555100847896…72300497271459300001
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.799 × 10⁹³(94-digit number)
87990008555100847896…72300497271459300001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.759 × 10⁹⁴(95-digit number)
17598001711020169579…44600994542918600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.519 × 10⁹⁴(95-digit number)
35196003422040339158…89201989085837200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.039 × 10⁹⁴(95-digit number)
70392006844080678317…78403978171674400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.407 × 10⁹⁵(96-digit number)
14078401368816135663…56807956343348800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.815 × 10⁹⁵(96-digit number)
28156802737632271326…13615912686697600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.631 × 10⁹⁵(96-digit number)
56313605475264542653…27231825373395200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.126 × 10⁹⁶(97-digit number)
11262721095052908530…54463650746790400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.252 × 10⁹⁶(97-digit number)
22525442190105817061…08927301493580800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.505 × 10⁹⁶(97-digit number)
45050884380211634123…17854602987161600001
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,983,855 XPM·at block #6,842,429 · 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