Block #839,576

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/4/2014, 12:36:41 PM · Difficulty 10.9745 · 5,993,576 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f7ab47c8d5a1ad3cf0a5376b359a35ac1937b72e0ecb7bc9c0e4aeebd31fc8ff

Height

#839,576

Difficulty

10.974523

Transactions

3

Size

625 B

Version

2

Bits

0af97a57

Nonce

581,303,248

Timestamp

12/4/2014, 12:36:41 PM

Confirmations

5,993,576

Merkle Root

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

4.828 × 10⁹⁷(98-digit number)
48289819905228013909…29080448707660992001
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
4.828 × 10⁹⁷(98-digit number)
48289819905228013909…29080448707660992001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.657 × 10⁹⁷(98-digit number)
96579639810456027819…58160897415321984001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.931 × 10⁹⁸(99-digit number)
19315927962091205563…16321794830643968001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.863 × 10⁹⁸(99-digit number)
38631855924182411127…32643589661287936001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.726 × 10⁹⁸(99-digit number)
77263711848364822255…65287179322575872001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.545 × 10⁹⁹(100-digit number)
15452742369672964451…30574358645151744001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.090 × 10⁹⁹(100-digit number)
30905484739345928902…61148717290303488001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.181 × 10⁹⁹(100-digit number)
61810969478691857804…22297434580606976001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.236 × 10¹⁰⁰(101-digit number)
12362193895738371560…44594869161213952001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.472 × 10¹⁰⁰(101-digit number)
24724387791476743121…89189738322427904001
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,909,393 XPM·at block #6,833,151 · 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