Block #805,527

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/10/2014, 4:52:57 PM · Difficulty 10.9747 · 6,012,124 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d1e369bc326ba1608260c89871841338c659033d3deeea1a8aae7b250fd4c7a2

Height

#805,527

Difficulty

10.974673

Transactions

5

Size

1.37 KB

Version

2

Bits

0af98425

Nonce

955,518,186

Timestamp

11/10/2014, 4:52:57 PM

Confirmations

6,012,124

Merkle Root

bd0bca4cad7252e8aae18e3fa25dc97e9a404ceb28fda26b862d6867a47495a6
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.449 × 10⁹⁵(96-digit number)
24499045658988019496…56827028665780612241
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.449 × 10⁹⁵(96-digit number)
24499045658988019496…56827028665780612241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.899 × 10⁹⁵(96-digit number)
48998091317976038993…13654057331561224481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.799 × 10⁹⁵(96-digit number)
97996182635952077987…27308114663122448961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.959 × 10⁹⁶(97-digit number)
19599236527190415597…54616229326244897921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.919 × 10⁹⁶(97-digit number)
39198473054380831195…09232458652489795841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.839 × 10⁹⁶(97-digit number)
78396946108761662390…18464917304979591681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.567 × 10⁹⁷(98-digit number)
15679389221752332478…36929834609959183361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.135 × 10⁹⁷(98-digit number)
31358778443504664956…73859669219918366721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.271 × 10⁹⁷(98-digit number)
62717556887009329912…47719338439836733441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.254 × 10⁹⁸(99-digit number)
12543511377401865982…95438676879673466881
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,785,260 XPM·at block #6,817,650 · 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