Block #839,625

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/4/2014, 1:25:47 PM · Difficulty 10.9745 · 6,005,362 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9921e2f0e156c69cc5f5f85cd9d9dbe706b421ba5a4c92905836f669a8edd204

Height

#839,625

Difficulty

10.974527

Transactions

5

Size

1.08 KB

Version

2

Bits

0af97a96

Nonce

1,783,061,212

Timestamp

12/4/2014, 1:25:47 PM

Confirmations

6,005,362

Merkle Root

c036d36402e986587ca44b6f205f8d8d334936fdc61d0c45504c6c178150b2e4
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.346 × 10⁹⁶(97-digit number)
33466283760576955413…24929963104935746561
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.346 × 10⁹⁶(97-digit number)
33466283760576955413…24929963104935746561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.693 × 10⁹⁶(97-digit number)
66932567521153910826…49859926209871493121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.338 × 10⁹⁷(98-digit number)
13386513504230782165…99719852419742986241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.677 × 10⁹⁷(98-digit number)
26773027008461564330…99439704839485972481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.354 × 10⁹⁷(98-digit number)
53546054016923128660…98879409678971944961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.070 × 10⁹⁸(99-digit number)
10709210803384625732…97758819357943889921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.141 × 10⁹⁸(99-digit number)
21418421606769251464…95517638715887779841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.283 × 10⁹⁸(99-digit number)
42836843213538502928…91035277431775559681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.567 × 10⁹⁸(99-digit number)
85673686427077005857…82070554863551119361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.713 × 10⁹⁹(100-digit number)
17134737285415401171…64141109727102238721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.426 × 10⁹⁹(100-digit number)
34269474570830802343…28282219454204477441
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:58,004,315 XPM·at block #6,844,986 · 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