Block #853,862

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/15/2014, 4:56:35 AM · Difficulty 10.9688 · 5,988,117 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4dbe686214dc3e3cb0ab60e0445f03506c9f5c29d2eca80e4f97966a55c068d3

Height

#853,862

Difficulty

10.968846

Transactions

4

Size

877 B

Version

2

Bits

0af80653

Nonce

69,980,187

Timestamp

12/15/2014, 4:56:35 AM

Confirmations

5,988,117

Merkle Root

0032771a784ed147ab680668b67acd745b941db6f3406b104f2b8f1ee5a88903
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.

3.276 × 10⁹³(94-digit number)
32763789956758341050…76154645342976015359
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
3.276 × 10⁹³(94-digit number)
32763789956758341050…76154645342976015359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.552 × 10⁹³(94-digit number)
65527579913516682101…52309290685952030719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.310 × 10⁹⁴(95-digit number)
13105515982703336420…04618581371904061439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.621 × 10⁹⁴(95-digit number)
26211031965406672840…09237162743808122879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.242 × 10⁹⁴(95-digit number)
52422063930813345681…18474325487616245759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.048 × 10⁹⁵(96-digit number)
10484412786162669136…36948650975232491519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.096 × 10⁹⁵(96-digit number)
20968825572325338272…73897301950464983039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.193 × 10⁹⁵(96-digit number)
41937651144650676544…47794603900929966079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.387 × 10⁹⁵(96-digit number)
83875302289301353089…95589207801859932159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.677 × 10⁹⁶(97-digit number)
16775060457860270617…91178415603719864319
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,980,217 XPM·at block #6,841,978 · 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