Block #800,717

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/7/2014, 2:40:08 AM · Difficulty 10.9763 · 6,007,357 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
18a40f94919b1b8cbc296babae714e715f0ab615105d8248d293ad77006c4769

Height

#800,717

Difficulty

10.976291

Transactions

5

Size

1.16 KB

Version

2

Bits

0af9ee39

Nonce

237,677,448

Timestamp

11/7/2014, 2:40:08 AM

Confirmations

6,007,357

Merkle Root

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

3.014 × 10⁹⁶(97-digit number)
30146951641919779661…26232597418815334401
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
3.014 × 10⁹⁶(97-digit number)
30146951641919779661…26232597418815334401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.029 × 10⁹⁶(97-digit number)
60293903283839559322…52465194837630668801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.205 × 10⁹⁷(98-digit number)
12058780656767911864…04930389675261337601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.411 × 10⁹⁷(98-digit number)
24117561313535823729…09860779350522675201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.823 × 10⁹⁷(98-digit number)
48235122627071647458…19721558701045350401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.647 × 10⁹⁷(98-digit number)
96470245254143294916…39443117402090700801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.929 × 10⁹⁸(99-digit number)
19294049050828658983…78886234804181401601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.858 × 10⁹⁸(99-digit number)
38588098101657317966…57772469608362803201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.717 × 10⁹⁸(99-digit number)
77176196203314635932…15544939216725606401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.543 × 10⁹⁹(100-digit number)
15435239240662927186…31089878433451212801
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,708,638 XPM·at block #6,808,073 · 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