Block #2,084,322

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/23/2017, 1:34:49 PM · Difficulty 10.8726 · 4,746,603 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0394069642283fd7400d54fbfa95612a2c44c16a5860e42d7a617466490815f3

Height

#2,084,322

Difficulty

10.872615

Transactions

2

Size

1.14 KB

Version

2

Bits

0adf63ad

Nonce

373,512,702

Timestamp

4/23/2017, 1:34:49 PM

Confirmations

4,746,603

Merkle Root

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

4.531 × 10⁹⁶(97-digit number)
45316072631757943794…25735715908136704001
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
4.531 × 10⁹⁶(97-digit number)
45316072631757943794…25735715908136704001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.063 × 10⁹⁶(97-digit number)
90632145263515887588…51471431816273408001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.812 × 10⁹⁷(98-digit number)
18126429052703177517…02942863632546816001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.625 × 10⁹⁷(98-digit number)
36252858105406355035…05885727265093632001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.250 × 10⁹⁷(98-digit number)
72505716210812710070…11771454530187264001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.450 × 10⁹⁸(99-digit number)
14501143242162542014…23542909060374528001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.900 × 10⁹⁸(99-digit number)
29002286484325084028…47085818120749056001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.800 × 10⁹⁸(99-digit number)
58004572968650168056…94171636241498112001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.160 × 10⁹⁹(100-digit number)
11600914593730033611…88343272482996224001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.320 × 10⁹⁹(100-digit number)
23201829187460067222…76686544965992448001
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,891,531 XPM·at block #6,830,924 · 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