Block #850,726

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/12/2014, 5:51:08 PM · Difficulty 10.9712 · 5,990,761 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7d11b0a3569eccf6f803f4a2eff84b2d7cdacedb48623af6281e3e698f84973d

Height

#850,726

Difficulty

10.971185

Transactions

17

Size

4.46 KB

Version

2

Bits

0af89f92

Nonce

1,740,793,448

Timestamp

12/12/2014, 5:51:08 PM

Confirmations

5,990,761

Merkle Root

25efafb108ab1210e3a68199a2c41bd789ae1b7d58913566c0bc06c79e620e4f
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.754 × 10⁹⁶(97-digit number)
27545730544135219700…35335580909393635841
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.754 × 10⁹⁶(97-digit number)
27545730544135219700…35335580909393635841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.509 × 10⁹⁶(97-digit number)
55091461088270439400…70671161818787271681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.101 × 10⁹⁷(98-digit number)
11018292217654087880…41342323637574543361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.203 × 10⁹⁷(98-digit number)
22036584435308175760…82684647275149086721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.407 × 10⁹⁷(98-digit number)
44073168870616351520…65369294550298173441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.814 × 10⁹⁷(98-digit number)
88146337741232703040…30738589100596346881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.762 × 10⁹⁸(99-digit number)
17629267548246540608…61477178201192693761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.525 × 10⁹⁸(99-digit number)
35258535096493081216…22954356402385387521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.051 × 10⁹⁸(99-digit number)
70517070192986162432…45908712804770775041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.410 × 10⁹⁹(100-digit number)
14103414038597232486…91817425609541550081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.820 × 10⁹⁹(100-digit number)
28206828077194464973…83634851219083100161
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,976,272 XPM·at block #6,841,486 · 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