Block #546,354

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/15/2014, 8:05:46 PM · Difficulty 10.9559 · 6,264,061 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
982c6e8992504f6e746e815cde0ac08572296262b308c449bbc3588f9990c05a

Height

#546,354

Difficulty

10.955854

Transactions

9

Size

4.35 KB

Version

2

Bits

0af4b2d3

Nonce

2,416,666,088

Timestamp

5/15/2014, 8:05:46 PM

Confirmations

6,264,061

Merkle Root

3e8b657abd47a082d7d932ca7c4401225dab55bf04cae892efe52042ed3a8749
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.

6.743 × 10⁹⁹(100-digit number)
67431785870912529808…48463594516128583681
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
6.743 × 10⁹⁹(100-digit number)
67431785870912529808…48463594516128583681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.348 × 10¹⁰⁰(101-digit number)
13486357174182505961…96927189032257167361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.697 × 10¹⁰⁰(101-digit number)
26972714348365011923…93854378064514334721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.394 × 10¹⁰⁰(101-digit number)
53945428696730023846…87708756129028669441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.078 × 10¹⁰¹(102-digit number)
10789085739346004769…75417512258057338881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.157 × 10¹⁰¹(102-digit number)
21578171478692009538…50835024516114677761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.315 × 10¹⁰¹(102-digit number)
43156342957384019077…01670049032229355521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.631 × 10¹⁰¹(102-digit number)
86312685914768038154…03340098064458711041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.726 × 10¹⁰²(103-digit number)
17262537182953607630…06680196128917422081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.452 × 10¹⁰²(103-digit number)
34525074365907215261…13360392257834844161
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,727,400 XPM·at block #6,810,414 · 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