Block #841,997

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/6/2014, 7:19:40 AM · Difficulty 10.9739 · 6,000,168 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d79f99323b912d89f80ac1030b5a05faf2bd6a9980addbd8fdfac4405140ea62

Height

#841,997

Difficulty

10.973876

Transactions

8

Size

2.18 KB

Version

2

Bits

0af94ff3

Nonce

1,182,892,619

Timestamp

12/6/2014, 7:19:40 AM

Confirmations

6,000,168

Merkle Root

8395a2fa5b1acd1246f94a6a036d86bdbc6ce9dae7773d10936030883bde2b42
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.362 × 10⁹⁷(98-digit number)
23627152426799800103…00268134839152035841
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.362 × 10⁹⁷(98-digit number)
23627152426799800103…00268134839152035841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.725 × 10⁹⁷(98-digit number)
47254304853599600206…00536269678304071681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.450 × 10⁹⁷(98-digit number)
94508609707199200413…01072539356608143361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.890 × 10⁹⁸(99-digit number)
18901721941439840082…02145078713216286721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.780 × 10⁹⁸(99-digit number)
37803443882879680165…04290157426432573441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.560 × 10⁹⁸(99-digit number)
75606887765759360331…08580314852865146881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.512 × 10⁹⁹(100-digit number)
15121377553151872066…17160629705730293761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.024 × 10⁹⁹(100-digit number)
30242755106303744132…34321259411460587521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.048 × 10⁹⁹(100-digit number)
60485510212607488264…68642518822921175041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.209 × 10¹⁰⁰(101-digit number)
12097102042521497652…37285037645842350081
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,981,711 XPM·at block #6,842,164 · 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