Block #844,350

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/8/2014, 1:34:31 AM · Difficulty 10.9730 · 5,999,402 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
eab6b40e126df4097b8d5e64bf3218e242175ba3c89404a7a95975d308edd0e2

Height

#844,350

Difficulty

10.972977

Transactions

2

Size

434 B

Version

2

Bits

0af9150c

Nonce

206,600,072

Timestamp

12/8/2014, 1:34:31 AM

Confirmations

5,999,402

Merkle Root

c0b18d23eeb915737069d40627fe5fa2a4b71d9983f985869b4d67532c9f04f1
Transactions (2)
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.

5.337 × 10⁹⁷(98-digit number)
53370142237566730018…26162683152786759681
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
5.337 × 10⁹⁷(98-digit number)
53370142237566730018…26162683152786759681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.067 × 10⁹⁸(99-digit number)
10674028447513346003…52325366305573519361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.134 × 10⁹⁸(99-digit number)
21348056895026692007…04650732611147038721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.269 × 10⁹⁸(99-digit number)
42696113790053384014…09301465222294077441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.539 × 10⁹⁸(99-digit number)
85392227580106768029…18602930444588154881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.707 × 10⁹⁹(100-digit number)
17078445516021353605…37205860889176309761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.415 × 10⁹⁹(100-digit number)
34156891032042707211…74411721778352619521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.831 × 10⁹⁹(100-digit number)
68313782064085414423…48823443556705239041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.366 × 10¹⁰⁰(101-digit number)
13662756412817082884…97646887113410478081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.732 × 10¹⁰⁰(101-digit number)
27325512825634165769…95293774226820956161
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,994,387 XPM·at block #6,843,751 · 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