Block #454,484

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/21/2014, 11:11:45 PM · Difficulty 10.3998 · 6,356,471 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
73392aec3c943a39962a53048096346d548f0c9271af242299f1f9a12a38bff2

Height

#454,484

Difficulty

10.399787

Transactions

2

Size

2.43 KB

Version

2

Bits

0a665870

Nonce

68,310

Timestamp

3/21/2014, 11:11:45 PM

Confirmations

6,356,471

Merkle Root

685f1e2c15001ef16dd62d75b313c038303f4636f7e07ff5952a5e493ae0af43
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.956 × 10⁹⁸(99-digit number)
19561306144273444515…34916072884615347561
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.956 × 10⁹⁸(99-digit number)
19561306144273444515…34916072884615347561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.912 × 10⁹⁸(99-digit number)
39122612288546889031…69832145769230695121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.824 × 10⁹⁸(99-digit number)
78245224577093778063…39664291538461390241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.564 × 10⁹⁹(100-digit number)
15649044915418755612…79328583076922780481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.129 × 10⁹⁹(100-digit number)
31298089830837511225…58657166153845560961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.259 × 10⁹⁹(100-digit number)
62596179661675022450…17314332307691121921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.251 × 10¹⁰⁰(101-digit number)
12519235932335004490…34628664615382243841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.503 × 10¹⁰⁰(101-digit number)
25038471864670008980…69257329230764487681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.007 × 10¹⁰⁰(101-digit number)
50076943729340017960…38514658461528975361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.001 × 10¹⁰¹(102-digit number)
10015388745868003592…77029316923057950721
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,731,740 XPM·at block #6,810,954 · 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