Block #828,381

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/26/2014, 3:32:55 AM · Difficulty 10.9782 · 5,980,779 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c9fe3beae9002d624c3854541229a83165ead161e5ffde4ac6de229344ff25dd

Height

#828,381

Difficulty

10.978230

Transactions

2

Size

1.15 KB

Version

2

Bits

0afa6d41

Nonce

303,375,278

Timestamp

11/26/2014, 3:32:55 AM

Confirmations

5,980,779

Merkle Root

83215620d355c6be54e2731bd3cbbcb232231e52d7dfb33d60e04c9e009338ad
Transactions (2)
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.378 × 10⁹⁷(98-digit number)
83781196678752761530…74093400236701583361
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.378 × 10⁹⁷(98-digit number)
83781196678752761530…74093400236701583361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.675 × 10⁹⁸(99-digit number)
16756239335750552306…48186800473403166721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.351 × 10⁹⁸(99-digit number)
33512478671501104612…96373600946806333441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.702 × 10⁹⁸(99-digit number)
67024957343002209224…92747201893612666881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.340 × 10⁹⁹(100-digit number)
13404991468600441844…85494403787225333761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.680 × 10⁹⁹(100-digit number)
26809982937200883689…70988807574450667521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.361 × 10⁹⁹(100-digit number)
53619965874401767379…41977615148901335041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.072 × 10¹⁰⁰(101-digit number)
10723993174880353475…83955230297802670081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.144 × 10¹⁰⁰(101-digit number)
21447986349760706951…67910460595605340161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.289 × 10¹⁰⁰(101-digit number)
42895972699521413903…35820921191210680321
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,717,341 XPM·at block #6,809,159 · 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