Block #2,020,827

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/13/2017, 6:00:33 AM · Difficulty 10.7133 · 4,806,323 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5030b9ebc44c89ee045d9cfcac4fdaa86a109b3d593fbee5310c7776b8efa8c2

Height

#2,020,827

Difficulty

10.713268

Transactions

2

Size

2.73 KB

Version

2

Bits

0ab698b7

Nonce

575,421,856

Timestamp

3/13/2017, 6:00:33 AM

Confirmations

4,806,323

Merkle Root

d9e3225eeb3c0ab1206b7c093dc6a9cdfb6665a4c798299832586c9f1578a10b
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.596 × 10⁹⁴(95-digit number)
15963899312140629661…63661784320487315201
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.596 × 10⁹⁴(95-digit number)
15963899312140629661…63661784320487315201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.192 × 10⁹⁴(95-digit number)
31927798624281259322…27323568640974630401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.385 × 10⁹⁴(95-digit number)
63855597248562518644…54647137281949260801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.277 × 10⁹⁵(96-digit number)
12771119449712503728…09294274563898521601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.554 × 10⁹⁵(96-digit number)
25542238899425007457…18588549127797043201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.108 × 10⁹⁵(96-digit number)
51084477798850014915…37177098255594086401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.021 × 10⁹⁶(97-digit number)
10216895559770002983…74354196511188172801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.043 × 10⁹⁶(97-digit number)
20433791119540005966…48708393022376345601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.086 × 10⁹⁶(97-digit number)
40867582239080011932…97416786044752691201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.173 × 10⁹⁶(97-digit number)
81735164478160023864…94833572089505382401
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,861,383 XPM·at block #6,827,149 · 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