Block #843,002

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/7/2014, 2:02:36 AM · Difficulty 10.9733 · 5,990,478 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e8f19adafb7ec42da03ce9d07a56204bdc0273e52408f4368850a7bb78e7a502

Height

#843,002

Difficulty

10.973309

Transactions

15

Size

3.29 KB

Version

2

Bits

0af92ac0

Nonce

726,771,564

Timestamp

12/7/2014, 2:02:36 AM

Confirmations

5,990,478

Merkle Root

7970f80ff5d1ffd8845fe33d3e1bc3418f9c4bdc461852641ecb2c4c49020b87
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.448 × 10⁹⁷(98-digit number)
14487399254315220220…68846012048166081281
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.448 × 10⁹⁷(98-digit number)
14487399254315220220…68846012048166081281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.897 × 10⁹⁷(98-digit number)
28974798508630440441…37692024096332162561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.794 × 10⁹⁷(98-digit number)
57949597017260880883…75384048192664325121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.158 × 10⁹⁸(99-digit number)
11589919403452176176…50768096385328650241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.317 × 10⁹⁸(99-digit number)
23179838806904352353…01536192770657300481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.635 × 10⁹⁸(99-digit number)
46359677613808704706…03072385541314600961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.271 × 10⁹⁸(99-digit number)
92719355227617409413…06144771082629201921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.854 × 10⁹⁹(100-digit number)
18543871045523481882…12289542165258403841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.708 × 10⁹⁹(100-digit number)
37087742091046963765…24579084330516807681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.417 × 10⁹⁹(100-digit number)
74175484182093927530…49158168661033615361
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,912,044 XPM·at block #6,833,479 · 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