Block #838,112

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/3/2014, 10:14:53 AM · Difficulty 10.9751 · 5,971,538 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f8bcc00e51def4b73a7502b57f3d159f68644a0392a95b7cc9e1b9ac736e0ada

Height

#838,112

Difficulty

10.975098

Transactions

13

Size

3.28 KB

Version

2

Bits

0af9a008

Nonce

2,170,150,068

Timestamp

12/3/2014, 10:14:53 AM

Confirmations

5,971,538

Merkle Root

617b8c337b63cf87741ccbb7daaa590d6412b64b46ca198b5b9632d0ca771f9d
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.

8.512 × 10⁹⁵(96-digit number)
85121164756964180787…82069285136335804161
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
8.512 × 10⁹⁵(96-digit number)
85121164756964180787…82069285136335804161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.702 × 10⁹⁶(97-digit number)
17024232951392836157…64138570272671608321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.404 × 10⁹⁶(97-digit number)
34048465902785672314…28277140545343216641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.809 × 10⁹⁶(97-digit number)
68096931805571344629…56554281090686433281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.361 × 10⁹⁷(98-digit number)
13619386361114268925…13108562181372866561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.723 × 10⁹⁷(98-digit number)
27238772722228537851…26217124362745733121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.447 × 10⁹⁷(98-digit number)
54477545444457075703…52434248725491466241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.089 × 10⁹⁸(99-digit number)
10895509088891415140…04868497450982932481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.179 × 10⁹⁸(99-digit number)
21791018177782830281…09736994901965864961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.358 × 10⁹⁸(99-digit number)
43582036355565660563…19473989803931729921
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,721,281 XPM·at block #6,809,649 · 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.

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