Block #853,225

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/14/2014, 5:23:19 PM · Difficulty 10.9692 · 5,987,711 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b69047b635c083980cba657d3dead17ff39f1954b69ca52239b87017aa7e0f18

Height

#853,225

Difficulty

10.969176

Transactions

4

Size

818 B

Version

2

Bits

0af81bec

Nonce

1,630,394,984

Timestamp

12/14/2014, 5:23:19 PM

Confirmations

5,987,711

Merkle Root

8e562437078877ab295a834f9d7ac1d36b5f4e87679f8f2359b0e3d4e8acff2b
Transactions (4)
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.219 × 10⁹⁷(98-digit number)
12197813995223871180…12987161896437958399
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.219 × 10⁹⁷(98-digit number)
12197813995223871180…12987161896437958399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.439 × 10⁹⁷(98-digit number)
24395627990447742361…25974323792875916799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.879 × 10⁹⁷(98-digit number)
48791255980895484722…51948647585751833599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
9.758 × 10⁹⁷(98-digit number)
97582511961790969444…03897295171503667199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.951 × 10⁹⁸(99-digit number)
19516502392358193888…07794590343007334399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.903 × 10⁹⁸(99-digit number)
39033004784716387777…15589180686014668799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
7.806 × 10⁹⁸(99-digit number)
78066009569432775555…31178361372029337599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.561 × 10⁹⁹(100-digit number)
15613201913886555111…62356722744058675199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.122 × 10⁹⁹(100-digit number)
31226403827773110222…24713445488117350399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.245 × 10⁹⁹(100-digit number)
62452807655546220444…49426890976234700799
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,971,842 XPM·at block #6,840,935 · 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