Block #850,727

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/12/2014, 5:53:17 PM · Difficulty 10.9712 · 5,992,120 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e677681d141d99cbb874c51dfba8c48b225e6169bea13dafc263ee888e4f2593

Height

#850,727

Difficulty

10.971176

Transactions

13

Size

3.14 KB

Version

2

Bits

0af89ef7

Nonce

187,725,772

Timestamp

12/12/2014, 5:53:17 PM

Confirmations

5,992,120

Merkle Root

9be00be68ae5ef458952a46e2beed28aa9de564b5090909362160c9c1e1f5ed0
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.967 × 10⁹⁶(97-digit number)
19673615257794727835…71132210955243027199
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.967 × 10⁹⁶(97-digit number)
19673615257794727835…71132210955243027199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.934 × 10⁹⁶(97-digit number)
39347230515589455671…42264421910486054399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.869 × 10⁹⁶(97-digit number)
78694461031178911342…84528843820972108799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.573 × 10⁹⁷(98-digit number)
15738892206235782268…69057687641944217599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.147 × 10⁹⁷(98-digit number)
31477784412471564536…38115375283888435199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.295 × 10⁹⁷(98-digit number)
62955568824943129073…76230750567776870399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.259 × 10⁹⁸(99-digit number)
12591113764988625814…52461501135553740799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.518 × 10⁹⁸(99-digit number)
25182227529977251629…04923002271107481599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.036 × 10⁹⁸(99-digit number)
50364455059954503258…09846004542214963199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.007 × 10⁹⁹(100-digit number)
10072891011990900651…19692009084429926399
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,987,121 XPM·at block #6,842,846 · 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