Block #2,068,973

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/13/2017, 7:22:47 AM · Difficulty 10.8566 · 4,776,687 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
92eaa3b51d029b7267ed36a99bd2915a934afc640e1d30c85596dd335d4d8a9f

Height

#2,068,973

Difficulty

10.856634

Transactions

3

Size

1.15 KB

Version

2

Bits

0adb4c63

Nonce

896,253,419

Timestamp

4/13/2017, 7:22:47 AM

Confirmations

4,776,687

Merkle Root

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

2.513 × 10⁹⁵(96-digit number)
25132723113895848263…61824323093426230081
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
2.513 × 10⁹⁵(96-digit number)
25132723113895848263…61824323093426230081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.026 × 10⁹⁵(96-digit number)
50265446227791696527…23648646186852460161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.005 × 10⁹⁶(97-digit number)
10053089245558339305…47297292373704920321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.010 × 10⁹⁶(97-digit number)
20106178491116678610…94594584747409840641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.021 × 10⁹⁶(97-digit number)
40212356982233357221…89189169494819681281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.042 × 10⁹⁶(97-digit number)
80424713964466714443…78378338989639362561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.608 × 10⁹⁷(98-digit number)
16084942792893342888…56756677979278725121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.216 × 10⁹⁷(98-digit number)
32169885585786685777…13513355958557450241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.433 × 10⁹⁷(98-digit number)
64339771171573371554…27026711917114900481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.286 × 10⁹⁸(99-digit number)
12867954234314674310…54053423834229800961
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:58,009,730 XPM·at block #6,845,659 · 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