Block #858,953

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/19/2014, 1:17:15 AM · Difficulty 10.9661 · 5,949,244 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9779382ced59c44c1d09ed502abde43d3da21a57615e2d2297d033cf519ac604

Height

#858,953

Difficulty

10.966096

Transactions

17

Size

3.38 KB

Version

2

Bits

0af75218

Nonce

157,026,424

Timestamp

12/19/2014, 1:17:15 AM

Confirmations

5,949,244

Merkle Root

524252b62dc80cd479f900894ef31eb00d5d94e8932487b7e20333a1788bf714
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.277 × 10⁹⁷(98-digit number)
22770846642470569912…24746596105458611199
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.277 × 10⁹⁷(98-digit number)
22770846642470569912…24746596105458611199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.554 × 10⁹⁷(98-digit number)
45541693284941139824…49493192210917222399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.108 × 10⁹⁷(98-digit number)
91083386569882279649…98986384421834444799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.821 × 10⁹⁸(99-digit number)
18216677313976455929…97972768843668889599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.643 × 10⁹⁸(99-digit number)
36433354627952911859…95945537687337779199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.286 × 10⁹⁸(99-digit number)
72866709255905823719…91891075374675558399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.457 × 10⁹⁹(100-digit number)
14573341851181164743…83782150749351116799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.914 × 10⁹⁹(100-digit number)
29146683702362329487…67564301498702233599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.829 × 10⁹⁹(100-digit number)
58293367404724658975…35128602997404467199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.165 × 10¹⁰⁰(101-digit number)
11658673480944931795…70257205994808934399
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,709,627 XPM·at block #6,808,196 · 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.

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