Block #856,195

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/16/2014, 9:53:14 PM · Difficulty 10.9682 · 5,953,660 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
af06dedc01a95ec97d7a420b36166b5c003bcbb16a8696d4c7b5156de9a0c255

Height

#856,195

Difficulty

10.968151

Transactions

14

Size

4.95 KB

Version

2

Bits

0af7d8c5

Nonce

81,348,759

Timestamp

12/16/2014, 9:53:14 PM

Confirmations

5,953,660

Merkle Root

90ba7c7ed04664ed1145001a7062102c018e458c9f0f56d7ca6af9690b0d0dba
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.

7.112 × 10⁹⁶(97-digit number)
71121514509207659931…70650908851069865599
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
7.112 × 10⁹⁶(97-digit number)
71121514509207659931…70650908851069865599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.422 × 10⁹⁷(98-digit number)
14224302901841531986…41301817702139731199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.844 × 10⁹⁷(98-digit number)
28448605803683063972…82603635404279462399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.689 × 10⁹⁷(98-digit number)
56897211607366127945…65207270808558924799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.137 × 10⁹⁸(99-digit number)
11379442321473225589…30414541617117849599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.275 × 10⁹⁸(99-digit number)
22758884642946451178…60829083234235699199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.551 × 10⁹⁸(99-digit number)
45517769285892902356…21658166468471398399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.103 × 10⁹⁸(99-digit number)
91035538571785804712…43316332936942796799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.820 × 10⁹⁹(100-digit number)
18207107714357160942…86632665873885593599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.641 × 10⁹⁹(100-digit number)
36414215428714321884…73265331747771187199
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,722,927 XPM·at block #6,809,854 · 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