Block #847,922

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/10/2014, 5:19:45 PM · Difficulty 10.9717 · 5,969,393 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
991a690d526eb39907781f380da934ab0e32250e20ee078c44530671cbcd98ba

Height

#847,922

Difficulty

10.971703

Transactions

11

Size

2.41 KB

Version

2

Bits

0af8c182

Nonce

1,029,176,973

Timestamp

12/10/2014, 5:19:45 PM

Confirmations

5,969,393

Merkle Root

b7025fdb8b398064780609edf4da47d8439d88507b923f3f58fc62f63cb6e5d3
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.

7.696 × 10⁹⁴(95-digit number)
76964827790646311794…10226078740186990561
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
7.696 × 10⁹⁴(95-digit number)
76964827790646311794…10226078740186990561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.539 × 10⁹⁵(96-digit number)
15392965558129262358…20452157480373981121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.078 × 10⁹⁵(96-digit number)
30785931116258524717…40904314960747962241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.157 × 10⁹⁵(96-digit number)
61571862232517049435…81808629921495924481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.231 × 10⁹⁶(97-digit number)
12314372446503409887…63617259842991848961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.462 × 10⁹⁶(97-digit number)
24628744893006819774…27234519685983697921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.925 × 10⁹⁶(97-digit number)
49257489786013639548…54469039371967395841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.851 × 10⁹⁶(97-digit number)
98514979572027279096…08938078743934791681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.970 × 10⁹⁷(98-digit number)
19702995914405455819…17876157487869583361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.940 × 10⁹⁷(98-digit number)
39405991828810911638…35752314975739166721
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,782,565 XPM·at block #6,817,314 · 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