Block #872,805

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/28/2014, 10:47:35 PM · Difficulty 10.9637 · 5,941,239 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1a2b44f7b6c94c9a009adbaeac78e6ddb35acf60990bdc58b1aa2c596d99959e

Height

#872,805

Difficulty

10.963735

Transactions

8

Size

3.19 KB

Version

2

Bits

0af6b756

Nonce

404,691,147

Timestamp

12/28/2014, 10:47:35 PM

Confirmations

5,941,239

Merkle Root

6f6e5cdcd4750942e4c6476c21dbee8a737ce47969876f2fb2ce114960320b34
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.030 × 10⁹⁵(96-digit number)
10309863863629874844…28047683655286815999
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.030 × 10⁹⁵(96-digit number)
10309863863629874844…28047683655286815999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.061 × 10⁹⁵(96-digit number)
20619727727259749689…56095367310573631999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.123 × 10⁹⁵(96-digit number)
41239455454519499379…12190734621147263999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.247 × 10⁹⁵(96-digit number)
82478910909038998758…24381469242294527999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.649 × 10⁹⁶(97-digit number)
16495782181807799751…48762938484589055999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.299 × 10⁹⁶(97-digit number)
32991564363615599503…97525876969178111999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.598 × 10⁹⁶(97-digit number)
65983128727231199006…95051753938356223999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.319 × 10⁹⁷(98-digit number)
13196625745446239801…90103507876712447999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.639 × 10⁹⁷(98-digit number)
26393251490892479602…80207015753424895999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.278 × 10⁹⁷(98-digit number)
52786502981784959205…60414031506849791999
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,756,427 XPM·at block #6,814,043 · 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