Block #451,360

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/19/2014, 9:25:05 PM · Difficulty 10.3815 · 6,357,537 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9b96aa9894121b859d07ee783f21b60dc15f70302a286082c3d02d2a8f875e34

Height

#451,360

Difficulty

10.381481

Transactions

7

Size

2.37 KB

Version

2

Bits

0a61a8c3

Nonce

32,122

Timestamp

3/19/2014, 9:25:05 PM

Confirmations

6,357,537

Merkle Root

0a73095b397142b1373b1297cc00578eec936388486cd537358959eb91aeb4b6
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.441 × 10¹⁰⁷(108-digit number)
14410275647620618188…56468867894628843519
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.441 × 10¹⁰⁷(108-digit number)
14410275647620618188…56468867894628843519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.882 × 10¹⁰⁷(108-digit number)
28820551295241236377…12937735789257687039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.764 × 10¹⁰⁷(108-digit number)
57641102590482472754…25875471578515374079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.152 × 10¹⁰⁸(109-digit number)
11528220518096494550…51750943157030748159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.305 × 10¹⁰⁸(109-digit number)
23056441036192989101…03501886314061496319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.611 × 10¹⁰⁸(109-digit number)
46112882072385978203…07003772628122992639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.222 × 10¹⁰⁸(109-digit number)
92225764144771956407…14007545256245985279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.844 × 10¹⁰⁹(110-digit number)
18445152828954391281…28015090512491970559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.689 × 10¹⁰⁹(110-digit number)
36890305657908782563…56030181024983941119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.378 × 10¹⁰⁹(110-digit number)
73780611315817565126…12060362049967882239
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,715,228 XPM·at block #6,808,896 · 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