Block #2,131,325

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/25/2017, 12:52:42 AM · Difficulty 10.9101 · 4,711,574 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5bb61ea7dde8c5f011b1a16667962fa4d0c8deba547f74eabc516efb7b1b4514

Height

#2,131,325

Difficulty

10.910066

Transactions

2

Size

575 B

Version

2

Bits

0ae8fa1c

Nonce

652,835,385

Timestamp

5/25/2017, 12:52:42 AM

Confirmations

4,711,574

Merkle Root

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

1.368 × 10⁹⁷(98-digit number)
13686920587699509275…42094134755938160641
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
1.368 × 10⁹⁷(98-digit number)
13686920587699509275…42094134755938160641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.737 × 10⁹⁷(98-digit number)
27373841175399018550…84188269511876321281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.474 × 10⁹⁷(98-digit number)
54747682350798037100…68376539023752642561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.094 × 10⁹⁸(99-digit number)
10949536470159607420…36753078047505285121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.189 × 10⁹⁸(99-digit number)
21899072940319214840…73506156095010570241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.379 × 10⁹⁸(99-digit number)
43798145880638429680…47012312190021140481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.759 × 10⁹⁸(99-digit number)
87596291761276859361…94024624380042280961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.751 × 10⁹⁹(100-digit number)
17519258352255371872…88049248760084561921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.503 × 10⁹⁹(100-digit number)
35038516704510743744…76098497520169123841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.007 × 10⁹⁹(100-digit number)
70077033409021487489…52196995040338247681
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,987,540 XPM·at block #6,842,898 · 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