Block #846,708

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/9/2014, 7:37:12 PM · Difficulty 10.9722 · 5,996,107 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
29f8addd3df3620330547c967a9c8fd18bd0ae3ac0d907285a2e868ae39d927d

Height

#846,708

Difficulty

10.972157

Transactions

7

Size

1.95 KB

Version

2

Bits

0af8df4d

Nonce

774,500,016

Timestamp

12/9/2014, 7:37:12 PM

Confirmations

5,996,107

Merkle Root

4ea95a48ebf593022a0f9d941f79631d7a6aa3a6e4ae53e3a975925e5600c532
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.

4.328 × 10⁹⁵(96-digit number)
43281794249413797954…90323611909754693761
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
4.328 × 10⁹⁵(96-digit number)
43281794249413797954…90323611909754693761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.656 × 10⁹⁵(96-digit number)
86563588498827595908…80647223819509387521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.731 × 10⁹⁶(97-digit number)
17312717699765519181…61294447639018775041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.462 × 10⁹⁶(97-digit number)
34625435399531038363…22588895278037550081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.925 × 10⁹⁶(97-digit number)
69250870799062076726…45177790556075100161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.385 × 10⁹⁷(98-digit number)
13850174159812415345…90355581112150200321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.770 × 10⁹⁷(98-digit number)
27700348319624830690…80711162224300400641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.540 × 10⁹⁷(98-digit number)
55400696639249661381…61422324448600801281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.108 × 10⁹⁸(99-digit number)
11080139327849932276…22844648897201602561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.216 × 10⁹⁸(99-digit number)
22160278655699864552…45689297794403205121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.432 × 10⁹⁸(99-digit number)
44320557311399729104…91378595588806410241
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,986,861 XPM·at block #6,842,814 · 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