Block #850,811

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/12/2014, 7:43:31 PM · Difficulty 10.9710 · 5,991,183 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3dbda95438a1424e4ec1b12dccd49f203f3e911e3a05a4c8801d5b19bf614b99

Height

#850,811

Difficulty

10.971018

Transactions

14

Size

3.59 KB

Version

2

Bits

0af894a6

Nonce

1,754,029,161

Timestamp

12/12/2014, 7:43:31 PM

Confirmations

5,991,183

Merkle Root

59b2ad547e8de739c10dfe31b3c629b02d7824d761fbe26fa2f035b75ea6c888
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.

1.100 × 10⁹⁷(98-digit number)
11007038592195598943…84428730385270150401
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
1.100 × 10⁹⁷(98-digit number)
11007038592195598943…84428730385270150401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.201 × 10⁹⁷(98-digit number)
22014077184391197887…68857460770540300801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.402 × 10⁹⁷(98-digit number)
44028154368782395775…37714921541080601601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.805 × 10⁹⁷(98-digit number)
88056308737564791550…75429843082161203201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.761 × 10⁹⁸(99-digit number)
17611261747512958310…50859686164322406401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.522 × 10⁹⁸(99-digit number)
35222523495025916620…01719372328644812801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.044 × 10⁹⁸(99-digit number)
70445046990051833240…03438744657289625601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.408 × 10⁹⁹(100-digit number)
14089009398010366648…06877489314579251201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.817 × 10⁹⁹(100-digit number)
28178018796020733296…13754978629158502401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.635 × 10⁹⁹(100-digit number)
56356037592041466592…27509957258317004801
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,980,340 XPM·at block #6,841,993 · 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