Block #455,428

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 3/22/2014, 1:37:50 PM · Difficulty 10.4098 · 6,361,371 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
0090722f666bcbef0b7b7b3463094f23e02d26bc5e5666dc4936b1cbf42c1d73

Height

#455,428

Difficulty

10.409765

Transactions

2

Size

859 B

Version

2

Bits

0a68e65e

Nonce

111,080

Timestamp

3/22/2014, 1:37:50 PM

Confirmations

6,361,371

Merkle Root

f6629655a0263d1b6891ba87f98738573f6abe23f2fed7e321ddea95347cfb66
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.622 × 10⁹⁷(98-digit number)
16222199000150943570…92113288707385597399
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.622 × 10⁹⁷(98-digit number)
16222199000150943570…92113288707385597399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.244 × 10⁹⁷(98-digit number)
32444398000301887140…84226577414771194799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.488 × 10⁹⁷(98-digit number)
64888796000603774281…68453154829542389599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.297 × 10⁹⁸(99-digit number)
12977759200120754856…36906309659084779199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.595 × 10⁹⁸(99-digit number)
25955518400241509712…73812619318169558399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.191 × 10⁹⁸(99-digit number)
51911036800483019425…47625238636339116799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.038 × 10⁹⁹(100-digit number)
10382207360096603885…95250477272678233599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.076 × 10⁹⁹(100-digit number)
20764414720193207770…90500954545356467199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.152 × 10⁹⁹(100-digit number)
41528829440386415540…81001909090712934399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.305 × 10⁹⁹(100-digit number)
83057658880772831080…62003818181425868799
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,778,427 XPM·at block #6,816,798 · 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