Block #852,617

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/14/2014, 6:14:30 AM · Difficulty 10.9695 · 5,992,196 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0c82e6006f1f6976467b3a04181a71e427a83ac7bed09a7716dc67f1373e8c38

Height

#852,617

Difficulty

10.969525

Transactions

3

Size

626 B

Version

2

Bits

0af832c6

Nonce

187,609,380

Timestamp

12/14/2014, 6:14:30 AM

Confirmations

5,992,196

Merkle Root

9bab5191c125182930015dc5070955c69b577ab939ab577f6362a5b7eef755fa
Transactions (3)
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.831 × 10⁹⁶(97-digit number)
18318177129797473305…84232355828299549441
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.831 × 10⁹⁶(97-digit number)
18318177129797473305…84232355828299549441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.663 × 10⁹⁶(97-digit number)
36636354259594946611…68464711656599098881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.327 × 10⁹⁶(97-digit number)
73272708519189893222…36929423313198197761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.465 × 10⁹⁷(98-digit number)
14654541703837978644…73858846626396395521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.930 × 10⁹⁷(98-digit number)
29309083407675957289…47717693252792791041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.861 × 10⁹⁷(98-digit number)
58618166815351914578…95435386505585582081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.172 × 10⁹⁸(99-digit number)
11723633363070382915…90870773011171164161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.344 × 10⁹⁸(99-digit number)
23447266726140765831…81741546022342328321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.689 × 10⁹⁸(99-digit number)
46894533452281531662…63483092044684656641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.378 × 10⁹⁸(99-digit number)
93789066904563063325…26966184089369313281
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:58,002,911 XPM·at block #6,844,812 · 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