Block #853,377

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/14/2014, 8:21:11 PM · Difficulty 10.9690 · 5,991,749 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5ae13f6a4410302c7aef467f964571b63a75f1d865dd499d928ee94221faba68

Height

#853,377

Difficulty

10.969015

Transactions

17

Size

3.74 KB

Version

2

Bits

0af81158

Nonce

1,390,580,945

Timestamp

12/14/2014, 8:21:11 PM

Confirmations

5,991,749

Merkle Root

992edad9970a5f36aac4d1d0662c4b00ae23240d8b31f8d2bda2062dcc3b5feb
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.

4.168 × 10⁹⁷(98-digit number)
41680408963088101550…28584959041340415999
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
4.168 × 10⁹⁷(98-digit number)
41680408963088101550…28584959041340415999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.336 × 10⁹⁷(98-digit number)
83360817926176203101…57169918082680831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.667 × 10⁹⁸(99-digit number)
16672163585235240620…14339836165361663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.334 × 10⁹⁸(99-digit number)
33344327170470481240…28679672330723327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.668 × 10⁹⁸(99-digit number)
66688654340940962481…57359344661446655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.333 × 10⁹⁹(100-digit number)
13337730868188192496…14718689322893311999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.667 × 10⁹⁹(100-digit number)
26675461736376384992…29437378645786623999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.335 × 10⁹⁹(100-digit number)
53350923472752769985…58874757291573247999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.067 × 10¹⁰⁰(101-digit number)
10670184694550553997…17749514583146495999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.134 × 10¹⁰⁰(101-digit number)
21340369389101107994…35499029166292991999
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:58,005,435 XPM·at block #6,845,125 · 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