Block #821,454

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 11/21/2014, 1:43:03 PM · Difficulty 10.9765 · 5,985,294 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
678b555edd7263c1c520651e40655480fbe5993f94edbe2396dab63e9659ab78

Height

#821,454

Difficulty

10.976503

Transactions

7

Size

3.26 KB

Version

2

Bits

0af9fc1e

Nonce

70,619,694

Timestamp

11/21/2014, 1:43:03 PM

Confirmations

5,985,294

Merkle Root

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

8.043 × 10⁹⁸(99-digit number)
80430680294160732396…66862925649226083199
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
8.043 × 10⁹⁸(99-digit number)
80430680294160732396…66862925649226083199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.608 × 10⁹⁹(100-digit number)
16086136058832146479…33725851298452166399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.217 × 10⁹⁹(100-digit number)
32172272117664292958…67451702596904332799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.434 × 10⁹⁹(100-digit number)
64344544235328585917…34903405193808665599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.286 × 10¹⁰⁰(101-digit number)
12868908847065717183…69806810387617331199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.573 × 10¹⁰⁰(101-digit number)
25737817694131434366…39613620775234662399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.147 × 10¹⁰⁰(101-digit number)
51475635388262868733…79227241550469324799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.029 × 10¹⁰¹(102-digit number)
10295127077652573746…58454483100938649599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.059 × 10¹⁰¹(102-digit number)
20590254155305147493…16908966201877299199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.118 × 10¹⁰¹(102-digit number)
41180508310610294987…33817932403754598399
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,698,082 XPM·at block #6,806,747 · 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