Block #454,400

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/21/2014, 9:46:12 PM · Difficulty 10.3998 · 6,352,472 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
69a25465cfe4ab93de9908ac523884f5dd3f16b26771042f2c8cf9f9c0b182a7

Height

#454,400

Difficulty

10.399808

Transactions

3

Size

1.50 KB

Version

2

Bits

0a6659d3

Nonce

10,907

Timestamp

3/21/2014, 9:46:12 PM

Confirmations

6,352,472

Merkle Root

6f83668fe35f3ba3cdbd87262553208d2cdf086481cf866c767330ecb7fff957
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.

3.977 × 10⁹⁸(99-digit number)
39776929524056438761…01278028554934336001
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
3.977 × 10⁹⁸(99-digit number)
39776929524056438761…01278028554934336001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.955 × 10⁹⁸(99-digit number)
79553859048112877523…02556057109868672001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.591 × 10⁹⁹(100-digit number)
15910771809622575504…05112114219737344001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.182 × 10⁹⁹(100-digit number)
31821543619245151009…10224228439474688001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.364 × 10⁹⁹(100-digit number)
63643087238490302019…20448456878949376001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.272 × 10¹⁰⁰(101-digit number)
12728617447698060403…40896913757898752001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.545 × 10¹⁰⁰(101-digit number)
25457234895396120807…81793827515797504001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.091 × 10¹⁰⁰(101-digit number)
50914469790792241615…63587655031595008001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.018 × 10¹⁰¹(102-digit number)
10182893958158448323…27175310063190016001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.036 × 10¹⁰¹(102-digit number)
20365787916316896646…54350620126380032001
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,699,083 XPM·at block #6,806,871 · 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