Block #456,373

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/23/2014, 4:50:09 AM · Difficulty 10.4143 · 6,359,945 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
72a5b1c08ca485f7073478c0c1bcd4730fbfb4d8d9bdb7a9e8c4dbb947675936

Height

#456,373

Difficulty

10.414341

Transactions

6

Size

1.39 KB

Version

2

Bits

0a6a123b

Nonce

3,062

Timestamp

3/23/2014, 4:50:09 AM

Confirmations

6,359,945

Merkle Root

35ac09699ea6046226ed09864059b959ada0d84c44a4d44ead8b130e6db9520e
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.

5.441 × 10⁹⁸(99-digit number)
54414114716853794286…57999497383410275839
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
5.441 × 10⁹⁸(99-digit number)
54414114716853794286…57999497383410275839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.088 × 10⁹⁹(100-digit number)
10882822943370758857…15998994766820551679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.176 × 10⁹⁹(100-digit number)
21765645886741517714…31997989533641103359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.353 × 10⁹⁹(100-digit number)
43531291773483035429…63995979067282206719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.706 × 10⁹⁹(100-digit number)
87062583546966070858…27991958134564413439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.741 × 10¹⁰⁰(101-digit number)
17412516709393214171…55983916269128826879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.482 × 10¹⁰⁰(101-digit number)
34825033418786428343…11967832538257653759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.965 × 10¹⁰⁰(101-digit number)
69650066837572856686…23935665076515307519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.393 × 10¹⁰¹(102-digit number)
13930013367514571337…47871330153030615039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.786 × 10¹⁰¹(102-digit number)
27860026735029142674…95742660306061230079
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,774,664 XPM·at block #6,816,317 · 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