Block #837,397

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/2/2014, 7:59:04 PM · Difficulty 10.9757 · 6,004,856 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
220c8b061443e43ae6ed0857888e1a3ab686e285254f665ba8dd522f2fa08ccb

Height

#837,397

Difficulty

10.975740

Transactions

10

Size

2.62 KB

Version

2

Bits

0af9ca19

Nonce

199,793

Timestamp

12/2/2014, 7:59:04 PM

Confirmations

6,004,856

Merkle Root

8fa36d2a1bd4bf2372aa78ba00033286edab383da1d1821d599d85b11a85d92f
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.

5.526 × 10⁹⁷(98-digit number)
55265407143335044757…84345520862916864001
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
5.526 × 10⁹⁷(98-digit number)
55265407143335044757…84345520862916864001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.105 × 10⁹⁸(99-digit number)
11053081428667008951…68691041725833728001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.210 × 10⁹⁸(99-digit number)
22106162857334017902…37382083451667456001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.421 × 10⁹⁸(99-digit number)
44212325714668035805…74764166903334912001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.842 × 10⁹⁸(99-digit number)
88424651429336071611…49528333806669824001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.768 × 10⁹⁹(100-digit number)
17684930285867214322…99056667613339648001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.536 × 10⁹⁹(100-digit number)
35369860571734428644…98113335226679296001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.073 × 10⁹⁹(100-digit number)
70739721143468857289…96226670453358592001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.414 × 10¹⁰⁰(101-digit number)
14147944228693771457…92453340906717184001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.829 × 10¹⁰⁰(101-digit number)
28295888457387542915…84906681813434368001
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,982,421 XPM·at block #6,842,252 · 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