Block #848,091

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/10/2014, 8:06:38 PM · Difficulty 10.9717 · 5,992,166 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
11d94ae953c05706947416c9e9b6a8622bc5f5a7eda723314ab8247fbfc1b1f1

Height

#848,091

Difficulty

10.971718

Transactions

5

Size

1.19 KB

Version

2

Bits

0af8c27c

Nonce

111,613,383

Timestamp

12/10/2014, 8:06:38 PM

Confirmations

5,992,166

Merkle Root

c10164e943e20a00bbdd0f76bae41affd02f487a99a0dcd8027d1fd6b146e30b
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.367 × 10⁹⁷(98-digit number)
13679365650340506860…96317219195190543359
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.367 × 10⁹⁷(98-digit number)
13679365650340506860…96317219195190543359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.735 × 10⁹⁷(98-digit number)
27358731300681013720…92634438390381086719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.471 × 10⁹⁷(98-digit number)
54717462601362027440…85268876780762173439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.094 × 10⁹⁸(99-digit number)
10943492520272405488…70537753561524346879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.188 × 10⁹⁸(99-digit number)
21886985040544810976…41075507123048693759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.377 × 10⁹⁸(99-digit number)
43773970081089621952…82151014246097387519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.754 × 10⁹⁸(99-digit number)
87547940162179243904…64302028492194775039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.750 × 10⁹⁹(100-digit number)
17509588032435848780…28604056984389550079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.501 × 10⁹⁹(100-digit number)
35019176064871697561…57208113968779100159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.003 × 10⁹⁹(100-digit number)
70038352129743395123…14416227937558200319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.400 × 10¹⁰⁰(101-digit number)
14007670425948679024…28832455875116400639
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,966,371 XPM·at block #6,840,256 · 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