Block #850,716

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/12/2014, 5:44:04 PM · Difficulty 10.9712 · 5,976,126 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
814d28f14cb98ba29ec5b4e094dd1e7a5c369836cffdeef84e9746b6703b2374

Height

#850,716

Difficulty

10.971170

Transactions

6

Size

1.31 KB

Version

2

Bits

0af89e92

Nonce

544,444,723

Timestamp

12/12/2014, 5:44:04 PM

Confirmations

5,976,126

Merkle Root

b2113dcc67aa500c7cf303e50ccd8802d1bd2131cf9e3cf04da54486c5ec0fab
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.

3.707 × 10⁹⁴(95-digit number)
37072027247358849466…44619956988280550279
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
3.707 × 10⁹⁴(95-digit number)
37072027247358849466…44619956988280550279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
7.414 × 10⁹⁴(95-digit number)
74144054494717698932…89239913976561100559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.482 × 10⁹⁵(96-digit number)
14828810898943539786…78479827953122201119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.965 × 10⁹⁵(96-digit number)
29657621797887079572…56959655906244402239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.931 × 10⁹⁵(96-digit number)
59315243595774159145…13919311812488804479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.186 × 10⁹⁶(97-digit number)
11863048719154831829…27838623624977608959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.372 × 10⁹⁶(97-digit number)
23726097438309663658…55677247249955217919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.745 × 10⁹⁶(97-digit number)
47452194876619327316…11354494499910435839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
9.490 × 10⁹⁶(97-digit number)
94904389753238654633…22708988999820871679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.898 × 10⁹⁷(98-digit number)
18980877950647730926…45417977999641743359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.796 × 10⁹⁷(98-digit number)
37961755901295461853…90835955999283486719
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 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
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 1CC formula:

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