Block #843,548

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/7/2014, 11:25:05 AM · Difficulty 10.9732 · 6,001,580 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f069a488aacd71669a87fa58d88855c336db83696afe1fdb95cd18dd7e0885ed

Height

#843,548

Difficulty

10.973208

Transactions

5

Size

1.23 KB

Version

2

Bits

0af92428

Nonce

791,969,240

Timestamp

12/7/2014, 11:25:05 AM

Confirmations

6,001,580

Merkle Root

863b14c860a450abb12cb44c960ee83c17582c3c2168ee217345d7fe92a54934
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.642 × 10⁹⁶(97-digit number)
56422647538179261273…67534440911301022719
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.642 × 10⁹⁶(97-digit number)
56422647538179261273…67534440911301022719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.128 × 10⁹⁷(98-digit number)
11284529507635852254…35068881822602045439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.256 × 10⁹⁷(98-digit number)
22569059015271704509…70137763645204090879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.513 × 10⁹⁷(98-digit number)
45138118030543409019…40275527290408181759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.027 × 10⁹⁷(98-digit number)
90276236061086818038…80551054580816363519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.805 × 10⁹⁸(99-digit number)
18055247212217363607…61102109161632727039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.611 × 10⁹⁸(99-digit number)
36110494424434727215…22204218323265454079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.222 × 10⁹⁸(99-digit number)
72220988848869454430…44408436646530908159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.444 × 10⁹⁹(100-digit number)
14444197769773890886…88816873293061816319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.888 × 10⁹⁹(100-digit number)
28888395539547781772…77633746586123632639
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:58,005,451 XPM·at block #6,845,127 · 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