Block #826,202

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/24/2014, 5:44:55 PM · Difficulty 10.9775 · 6,000,907 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4d6f92cca4d6db99ed5ee364f2d7515ee3d2b2abed7037929f1c41452ba3fa80

Height

#826,202

Difficulty

10.977491

Transactions

4

Size

1.01 KB

Version

2

Bits

0afa3cd4

Nonce

2,521,034,840

Timestamp

11/24/2014, 5:44:55 PM

Confirmations

6,000,907

Merkle Root

67f6120e283f8860595152699e1b6c42e022c0aecc78043a1491e77013e900ae
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.472 × 10⁹⁷(98-digit number)
24726984297499302350…06496757363927552001
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.472 × 10⁹⁷(98-digit number)
24726984297499302350…06496757363927552001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.945 × 10⁹⁷(98-digit number)
49453968594998604700…12993514727855104001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.890 × 10⁹⁷(98-digit number)
98907937189997209400…25987029455710208001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.978 × 10⁹⁸(99-digit number)
19781587437999441880…51974058911420416001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.956 × 10⁹⁸(99-digit number)
39563174875998883760…03948117822840832001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.912 × 10⁹⁸(99-digit number)
79126349751997767520…07896235645681664001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.582 × 10⁹⁹(100-digit number)
15825269950399553504…15792471291363328001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.165 × 10⁹⁹(100-digit number)
31650539900799107008…31584942582726656001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.330 × 10⁹⁹(100-digit number)
63301079801598214016…63169885165453312001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.266 × 10¹⁰⁰(101-digit number)
12660215960319642803…26339770330906624001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.532 × 10¹⁰⁰(101-digit number)
25320431920639285606…52679540661813248001
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,861,051 XPM·at block #6,827,108 · 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