Block #454,135

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/21/2014, 5:58:01 PM · Difficulty 10.3953 · 6,356,959 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b909a55e4a2339fc4babe9d324f27df7918006d818b866b5d5ae0114b60d8752

Height

#454,135

Difficulty

10.395299

Transactions

1

Size

937 B

Version

2

Bits

0a653256

Nonce

71,097

Timestamp

3/21/2014, 5:58:01 PM

Confirmations

6,356,959

Merkle Root

b9be758c05f1cd85b91486c7f51aa87e82ec53e3e63812ceb3e63c03f8cbcbbc
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.

8.896 × 10⁹⁸(99-digit number)
88960853505679646621…43679760705307413121
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
8.896 × 10⁹⁸(99-digit number)
88960853505679646621…43679760705307413121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.779 × 10⁹⁹(100-digit number)
17792170701135929324…87359521410614826241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.558 × 10⁹⁹(100-digit number)
35584341402271858648…74719042821229652481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.116 × 10⁹⁹(100-digit number)
71168682804543717297…49438085642459304961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.423 × 10¹⁰⁰(101-digit number)
14233736560908743459…98876171284918609921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.846 × 10¹⁰⁰(101-digit number)
28467473121817486919…97752342569837219841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.693 × 10¹⁰⁰(101-digit number)
56934946243634973838…95504685139674439681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.138 × 10¹⁰¹(102-digit number)
11386989248726994767…91009370279348879361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.277 × 10¹⁰¹(102-digit number)
22773978497453989535…82018740558697758721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.554 × 10¹⁰¹(102-digit number)
45547956994907979070…64037481117395517441
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,732,860 XPM·at block #6,811,093 · 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