Block #843,317

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/7/2014, 7:37:55 AM · Difficulty 10.9732 · 6,001,147 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
db9031b15fd89cf9f3eafc068750a9e77a2652c3583d289ac82916598f933b2e

Height

#843,317

Difficulty

10.973178

Transactions

9

Size

2.65 KB

Version

2

Bits

0af9222f

Nonce

585,686,017

Timestamp

12/7/2014, 7:37:55 AM

Confirmations

6,001,147

Merkle Root

c2b98db3a8727eef5ae8f5789a35e1989f228a858ae49a25bf682d26e221df06
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.

8.106 × 10⁹⁴(95-digit number)
81061818012645758111…82367917326225844499
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
8.106 × 10⁹⁴(95-digit number)
81061818012645758111…82367917326225844499
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.621 × 10⁹⁵(96-digit number)
16212363602529151622…64735834652451688999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.242 × 10⁹⁵(96-digit number)
32424727205058303244…29471669304903377999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.484 × 10⁹⁵(96-digit number)
64849454410116606489…58943338609806755999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.296 × 10⁹⁶(97-digit number)
12969890882023321297…17886677219613511999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.593 × 10⁹⁶(97-digit number)
25939781764046642595…35773354439227023999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.187 × 10⁹⁶(97-digit number)
51879563528093285191…71546708878454047999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.037 × 10⁹⁷(98-digit number)
10375912705618657038…43093417756908095999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.075 × 10⁹⁷(98-digit number)
20751825411237314076…86186835513816191999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.150 × 10⁹⁷(98-digit number)
41503650822474628153…72373671027632383999
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,000,106 XPM·at block #6,844,463 · 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