Block #839,825

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/4/2014, 5:00:39 PM · Difficulty 10.9745 · 6,000,935 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1463cf9923989e026a36d2811ed6453e0073ed30a5b39aa1e9c4cd9f43bf2b95

Height

#839,825

Difficulty

10.974453

Transactions

7

Size

1.96 KB

Version

2

Bits

0af975c0

Nonce

2,240,075,928

Timestamp

12/4/2014, 5:00:39 PM

Confirmations

6,000,935

Merkle Root

be06e06e8faf7fc4452ba3f69e871f4bc2451ed4b2f9b5385b57e6dfe51a3038
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.318 × 10⁹⁵(96-digit number)
23183143022186413778…22962116774191813681
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.318 × 10⁹⁵(96-digit number)
23183143022186413778…22962116774191813681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.636 × 10⁹⁵(96-digit number)
46366286044372827557…45924233548383627361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.273 × 10⁹⁵(96-digit number)
92732572088745655114…91848467096767254721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.854 × 10⁹⁶(97-digit number)
18546514417749131022…83696934193534509441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.709 × 10⁹⁶(97-digit number)
37093028835498262045…67393868387069018881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.418 × 10⁹⁶(97-digit number)
74186057670996524091…34787736774138037761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.483 × 10⁹⁷(98-digit number)
14837211534199304818…69575473548276075521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.967 × 10⁹⁷(98-digit number)
29674423068398609636…39150947096552151041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.934 × 10⁹⁷(98-digit number)
59348846136797219273…78301894193104302081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.186 × 10⁹⁸(99-digit number)
11869769227359443854…56603788386208604161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.373 × 10⁹⁸(99-digit number)
23739538454718887709…13207576772417208321
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,970,421 XPM·at block #6,840,759 · 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