Block #850,816

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/12/2014, 7:48:05 PM · Difficulty 10.9710 · 5,991,443 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
29d441427e76e2dabbbadfd87aa24356c46123d58d908f14d0ad130885fe5972

Height

#850,816

Difficulty

10.971025

Transactions

6

Size

2.33 KB

Version

2

Bits

0af89519

Nonce

1,067,752,424

Timestamp

12/12/2014, 7:48:05 PM

Confirmations

5,991,443

Merkle Root

2dced89db29327c1db8ee3e7c7ed7d519b7609349e4067c3abab8502002ff356
Transactions (6)
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.111 × 10⁹⁶(97-digit number)
21111264812131731678…52828985110426860161
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.111 × 10⁹⁶(97-digit number)
21111264812131731678…52828985110426860161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.222 × 10⁹⁶(97-digit number)
42222529624263463356…05657970220853720321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.444 × 10⁹⁶(97-digit number)
84445059248526926712…11315940441707440641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.688 × 10⁹⁷(98-digit number)
16889011849705385342…22631880883414881281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.377 × 10⁹⁷(98-digit number)
33778023699410770684…45263761766829762561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.755 × 10⁹⁷(98-digit number)
67556047398821541369…90527523533659525121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.351 × 10⁹⁸(99-digit number)
13511209479764308273…81055047067319050241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.702 × 10⁹⁸(99-digit number)
27022418959528616547…62110094134638100481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.404 × 10⁹⁸(99-digit number)
54044837919057233095…24220188269276200961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.080 × 10⁹⁹(100-digit number)
10808967583811446619…48440376538552401921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.161 × 10⁹⁹(100-digit number)
21617935167622893238…96880753077104803841
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,982,470 XPM·at block #6,842,258 · 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