Block #854,423

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/15/2014, 2:55:19 PM · Difficulty 10.9686 · 5,989,460 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6f8ed51ce0b720787efa931f46d52b06a74b881e81aa871f9c6e7bb06a013262

Height

#854,423

Difficulty

10.968628

Transactions

13

Size

3.71 KB

Version

2

Bits

0af7f7fb

Nonce

506,368,600

Timestamp

12/15/2014, 2:55:19 PM

Confirmations

5,989,460

Merkle Root

59374bc31d03dd6efa812f6a2efc482f36bbe7253ed66f120942ce6f4db02a75
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.

9.784 × 10⁹⁷(98-digit number)
97843567743807830847…43852543871530680319
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
9.784 × 10⁹⁷(98-digit number)
97843567743807830847…43852543871530680319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.956 × 10⁹⁸(99-digit number)
19568713548761566169…87705087743061360639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.913 × 10⁹⁸(99-digit number)
39137427097523132339…75410175486122721279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.827 × 10⁹⁸(99-digit number)
78274854195046264678…50820350972245442559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.565 × 10⁹⁹(100-digit number)
15654970839009252935…01640701944490885119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.130 × 10⁹⁹(100-digit number)
31309941678018505871…03281403888981770239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.261 × 10⁹⁹(100-digit number)
62619883356037011742…06562807777963540479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.252 × 10¹⁰⁰(101-digit number)
12523976671207402348…13125615555927080959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.504 × 10¹⁰⁰(101-digit number)
25047953342414804697…26251231111854161919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.009 × 10¹⁰⁰(101-digit number)
50095906684829609394…52502462223708323839
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,995,436 XPM·at block #6,843,882 · 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