Block #546,508

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/15/2014, 10:12:08 PM · Difficulty 10.9561 · 6,268,433 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
714590d6bae8c47ad5351e313610276ea40be100cc4b21be393ec7c84b80861e

Height

#546,508

Difficulty

10.956091

Transactions

9

Size

2.69 KB

Version

2

Bits

0af4c269

Nonce

338,808,133

Timestamp

5/15/2014, 10:12:08 PM

Confirmations

6,268,433

Merkle Root

653df016c0a91ca8e41cb6bec2c28b796199ea2fef24ea13572a480b81e44076
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.

2.845 × 10⁹⁹(100-digit number)
28454914615298302129…49540493566945547841
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
2.845 × 10⁹⁹(100-digit number)
28454914615298302129…49540493566945547841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.690 × 10⁹⁹(100-digit number)
56909829230596604259…99080987133891095681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.138 × 10¹⁰⁰(101-digit number)
11381965846119320851…98161974267782191361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.276 × 10¹⁰⁰(101-digit number)
22763931692238641703…96323948535564382721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.552 × 10¹⁰⁰(101-digit number)
45527863384477283407…92647897071128765441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.105 × 10¹⁰⁰(101-digit number)
91055726768954566814…85295794142257530881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.821 × 10¹⁰¹(102-digit number)
18211145353790913362…70591588284515061761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.642 × 10¹⁰¹(102-digit number)
36422290707581826725…41183176569030123521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.284 × 10¹⁰¹(102-digit number)
72844581415163653451…82366353138060247041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.456 × 10¹⁰²(103-digit number)
14568916283032730690…64732706276120494081
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,763,624 XPM·at block #6,814,940 · 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