Block #842,825

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/6/2014, 10:33:26 PM · Difficulty 10.9735 · 6,000,286 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d39a76cefe19b259a850b8058b4f3fcf9ff88cbe17c8dc6f518a4bae59555123

Height

#842,825

Difficulty

10.973450

Transactions

8

Size

1.75 KB

Version

2

Bits

0af93406

Nonce

56,955,326

Timestamp

12/6/2014, 10:33:26 PM

Confirmations

6,000,286

Merkle Root

7b64364c5982c2be904bdfe2d01e762cdc37990e43730d75ff2335ca59b077a8
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.277 × 10⁹⁴(95-digit number)
22771978064883406841…79028239064096258921
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.277 × 10⁹⁴(95-digit number)
22771978064883406841…79028239064096258921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.554 × 10⁹⁴(95-digit number)
45543956129766813683…58056478128192517841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.108 × 10⁹⁴(95-digit number)
91087912259533627367…16112956256385035681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.821 × 10⁹⁵(96-digit number)
18217582451906725473…32225912512770071361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.643 × 10⁹⁵(96-digit number)
36435164903813450947…64451825025540142721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.287 × 10⁹⁵(96-digit number)
72870329807626901894…28903650051080285441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.457 × 10⁹⁶(97-digit number)
14574065961525380378…57807300102160570881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.914 × 10⁹⁶(97-digit number)
29148131923050760757…15614600204321141761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.829 × 10⁹⁶(97-digit number)
58296263846101521515…31229200408642283521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.165 × 10⁹⁷(98-digit number)
11659252769220304303…62458400817284567041
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,989,253 XPM·at block #6,843,110 · 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