Block #825,718

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/24/2014, 10:21:57 AM · Difficulty 10.9773 · 5,984,107 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1d0c3bcdb738685a39092c7773cb63a43cc991055ae1e73df05bc4c88be0cc10

Height

#825,718

Difficulty

10.977303

Transactions

4

Size

1.59 KB

Version

2

Bits

0afa308c

Nonce

198,949,665

Timestamp

11/24/2014, 10:21:57 AM

Confirmations

5,984,107

Merkle Root

2860d4c5523e39a0785ac0dffea3741d737dac482af9ff1f6a351104523d13ec
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.018 × 10⁹⁸(99-digit number)
10186743175103647838…53132163467553439999
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.018 × 10⁹⁸(99-digit number)
10186743175103647838…53132163467553439999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.037 × 10⁹⁸(99-digit number)
20373486350207295677…06264326935106879999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.074 × 10⁹⁸(99-digit number)
40746972700414591354…12528653870213759999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.149 × 10⁹⁸(99-digit number)
81493945400829182708…25057307740427519999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.629 × 10⁹⁹(100-digit number)
16298789080165836541…50114615480855039999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.259 × 10⁹⁹(100-digit number)
32597578160331673083…00229230961710079999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.519 × 10⁹⁹(100-digit number)
65195156320663346166…00458461923420159999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.303 × 10¹⁰⁰(101-digit number)
13039031264132669233…00916923846840319999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.607 × 10¹⁰⁰(101-digit number)
26078062528265338466…01833847693680639999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.215 × 10¹⁰⁰(101-digit number)
52156125056530676933…03667695387361279999
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,722,685 XPM·at block #6,809,824 · 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