Block #839,340

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/4/2014, 8:15:09 AM · Difficulty 10.9746 · 6,003,387 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
50ddeaa49edb2febb55e01375497e742c5bcb0ca337646e3c2427d6a0a962873

Height

#839,340

Difficulty

10.974648

Transactions

9

Size

5.15 KB

Version

2

Bits

0af98289

Nonce

91,358,805

Timestamp

12/4/2014, 8:15:09 AM

Confirmations

6,003,387

Merkle Root

4a9d92a38be35cbbd3b3722f16e29c7b55fb88bd8fee9484dd82894feade65ef
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.

1.822 × 10⁹⁵(96-digit number)
18224102887828084968…51417627779198595501
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
1.822 × 10⁹⁵(96-digit number)
18224102887828084968…51417627779198595501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.644 × 10⁹⁵(96-digit number)
36448205775656169936…02835255558397191001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.289 × 10⁹⁵(96-digit number)
72896411551312339872…05670511116794382001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.457 × 10⁹⁶(97-digit number)
14579282310262467974…11341022233588764001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.915 × 10⁹⁶(97-digit number)
29158564620524935948…22682044467177528001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.831 × 10⁹⁶(97-digit number)
58317129241049871897…45364088934355056001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.166 × 10⁹⁷(98-digit number)
11663425848209974379…90728177868710112001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.332 × 10⁹⁷(98-digit number)
23326851696419948759…81456355737420224001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.665 × 10⁹⁷(98-digit number)
46653703392839897518…62912711474840448001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.330 × 10⁹⁷(98-digit number)
93307406785679795036…25825422949680896001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.866 × 10⁹⁸(99-digit number)
18661481357135959007…51650845899361792001
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,986,155 XPM·at block #6,842,726 · 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