Block #849,502

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/11/2014, 8:51:13 PM · Difficulty 10.9714 · 5,992,526 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
54b4dff87f7f5e4a4f1ee82ca9070006d4d32cecaf7ffe31e2ac22eea1d770a4

Height

#849,502

Difficulty

10.971356

Transactions

17

Size

4.19 KB

Version

2

Bits

0af8aace

Nonce

837,506,220

Timestamp

12/11/2014, 8:51:13 PM

Confirmations

5,992,526

Merkle Root

58e650156841704636f24427c46a26f30fb82dd559804877bf340cd71b128883
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.967 × 10⁹⁵(96-digit number)
59673173010865370607…90370621539689297921
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.967 × 10⁹⁵(96-digit number)
59673173010865370607…90370621539689297921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.193 × 10⁹⁶(97-digit number)
11934634602173074121…80741243079378595841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.386 × 10⁹⁶(97-digit number)
23869269204346148243…61482486158757191681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.773 × 10⁹⁶(97-digit number)
47738538408692296486…22964972317514383361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.547 × 10⁹⁶(97-digit number)
95477076817384592972…45929944635028766721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.909 × 10⁹⁷(98-digit number)
19095415363476918594…91859889270057533441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.819 × 10⁹⁷(98-digit number)
38190830726953837188…83719778540115066881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.638 × 10⁹⁷(98-digit number)
76381661453907674377…67439557080230133761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.527 × 10⁹⁸(99-digit number)
15276332290781534875…34879114160460267521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.055 × 10⁹⁸(99-digit number)
30552664581563069751…69758228320920535041
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,980,610 XPM·at block #6,842,027 · 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