Block #840,859

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/5/2014, 11:08:35 AM · Difficulty 10.9742 · 5,975,966 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0e51dcb882859faec43a9cc0e89ca592d113883e6977c896fa5e036a369291d5

Height

#840,859

Difficulty

10.974219

Transactions

5

Size

9.87 KB

Version

2

Bits

0af9666d

Nonce

1,522,121,032

Timestamp

12/5/2014, 11:08:35 AM

Confirmations

5,975,966

Merkle Root

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

7.472 × 10⁹⁵(96-digit number)
74729155175096734682…17418648789772171521
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
7.472 × 10⁹⁵(96-digit number)
74729155175096734682…17418648789772171521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.494 × 10⁹⁶(97-digit number)
14945831035019346936…34837297579544343041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.989 × 10⁹⁶(97-digit number)
29891662070038693872…69674595159088686081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.978 × 10⁹⁶(97-digit number)
59783324140077387745…39349190318177372161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.195 × 10⁹⁷(98-digit number)
11956664828015477549…78698380636354744321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.391 × 10⁹⁷(98-digit number)
23913329656030955098…57396761272709488641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.782 × 10⁹⁷(98-digit number)
47826659312061910196…14793522545418977281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.565 × 10⁹⁷(98-digit number)
95653318624123820393…29587045090837954561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.913 × 10⁹⁸(99-digit number)
19130663724824764078…59174090181675909121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.826 × 10⁹⁸(99-digit number)
38261327449649528157…18348180363351818241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.652 × 10⁹⁸(99-digit number)
76522654899299056314…36696360726703636481
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,778,640 XPM·at block #6,816,824 · 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