Block #846,221

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/9/2014, 11:14:42 AM · Difficulty 10.9722 · 5,998,448 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1ae56eba4b1c1988719efb02d45f9478d793d6d2261d0206513069c50a1c34e7

Height

#846,221

Difficulty

10.972233

Transactions

9

Size

5.43 KB

Version

2

Bits

0af8e444

Nonce

354,231,521

Timestamp

12/9/2014, 11:14:42 AM

Confirmations

5,998,448

Merkle Root

5dd5d62f0f5314adf12ad37d6e697c39918d027922f3f2c8a2ecd2a08fccfebd
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.

7.593 × 10⁹³(94-digit number)
75937504374459562480…50490800013040887039
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
7.593 × 10⁹³(94-digit number)
75937504374459562480…50490800013040887039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.518 × 10⁹⁴(95-digit number)
15187500874891912496…00981600026081774079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.037 × 10⁹⁴(95-digit number)
30375001749783824992…01963200052163548159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.075 × 10⁹⁴(95-digit number)
60750003499567649984…03926400104327096319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.215 × 10⁹⁵(96-digit number)
12150000699913529996…07852800208654192639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.430 × 10⁹⁵(96-digit number)
24300001399827059993…15705600417308385279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.860 × 10⁹⁵(96-digit number)
48600002799654119987…31411200834616770559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.720 × 10⁹⁵(96-digit number)
97200005599308239974…62822401669233541119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.944 × 10⁹⁶(97-digit number)
19440001119861647994…25644803338467082239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.888 × 10⁹⁶(97-digit number)
38880002239723295989…51289606676934164479
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:58,001,756 XPM·at block #6,844,668 · 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