Block #457,477

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/23/2014, 10:24:22 PM · Difficulty 10.4210 · 6,351,592 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5279268f82e7a29b182094c8bc7c1b9c69007626f092ecb0cc96e0630517b5b3

Height

#457,477

Difficulty

10.420966

Transactions

8

Size

1.86 KB

Version

2

Bits

0a6bc468

Nonce

161,654

Timestamp

3/23/2014, 10:24:22 PM

Confirmations

6,351,592

Merkle Root

352b5daf309669b9c9c448afcf0cbc289fb48c49ef02027d4826b29d23d9265d
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.404 × 10¹⁰⁰(101-digit number)
14040741519458347104…37026974212800983039
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.404 × 10¹⁰⁰(101-digit number)
14040741519458347104…37026974212800983039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.808 × 10¹⁰⁰(101-digit number)
28081483038916694208…74053948425601966079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.616 × 10¹⁰⁰(101-digit number)
56162966077833388417…48107896851203932159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.123 × 10¹⁰¹(102-digit number)
11232593215566677683…96215793702407864319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.246 × 10¹⁰¹(102-digit number)
22465186431133355366…92431587404815728639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.493 × 10¹⁰¹(102-digit number)
44930372862266710733…84863174809631457279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.986 × 10¹⁰¹(102-digit number)
89860745724533421467…69726349619262914559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.797 × 10¹⁰²(103-digit number)
17972149144906684293…39452699238525829119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.594 × 10¹⁰²(103-digit number)
35944298289813368587…78905398477051658239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.188 × 10¹⁰²(103-digit number)
71888596579626737174…57810796954103316479
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,716,619 XPM·at block #6,809,068 · 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