Block #686,047

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 8/21/2014, 7:35:03 AM · Difficulty 10.9545 · 6,120,564 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f874e1d10d81dd37ef69adf6fb51cee154824ed7d1d17c51b887bf27dafb250f

Height

#686,047

Difficulty

10.954536

Transactions

7

Size

1.96 KB

Version

2

Bits

0af45c77

Nonce

691,207,255

Timestamp

8/21/2014, 7:35:03 AM

Confirmations

6,120,564

Merkle Root

426f8330ebe1482b428440e1a6db5815de6e6ac8640f46c612841f37fbc0f0de
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.473 × 10⁹⁵(96-digit number)
24731430441532111579…17120478100953607281
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.473 × 10⁹⁵(96-digit number)
24731430441532111579…17120478100953607281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.946 × 10⁹⁵(96-digit number)
49462860883064223158…34240956201907214561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.892 × 10⁹⁵(96-digit number)
98925721766128446316…68481912403814429121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.978 × 10⁹⁶(97-digit number)
19785144353225689263…36963824807628858241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.957 × 10⁹⁶(97-digit number)
39570288706451378526…73927649615257716481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.914 × 10⁹⁶(97-digit number)
79140577412902757053…47855299230515432961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.582 × 10⁹⁷(98-digit number)
15828115482580551410…95710598461030865921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.165 × 10⁹⁷(98-digit number)
31656230965161102821…91421196922061731841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.331 × 10⁹⁷(98-digit number)
63312461930322205642…82842393844123463681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.266 × 10⁹⁸(99-digit number)
12662492386064441128…65684787688246927361
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,696,987 XPM·at block #6,806,610 · 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.

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