Block #543,112

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/14/2014, 6:20:40 AM · Difficulty 10.9463 · 6,273,514 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d7e7ea296cc91225bc6c88a9a630b888da760a51343088b13fc03086e75e6219

Height

#543,112

Difficulty

10.946258

Transactions

5

Size

1.08 KB

Version

2

Bits

0af23dfe

Nonce

37,372,710

Timestamp

5/14/2014, 6:20:40 AM

Confirmations

6,273,514

Merkle Root

7a6c64b8399cf3423a7edd68071876445365d5c8756752f9dfadd2a792f13216
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.047 × 10⁹⁸(99-digit number)
10471398645251825304…72511322558650937841
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.047 × 10⁹⁸(99-digit number)
10471398645251825304…72511322558650937841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.094 × 10⁹⁸(99-digit number)
20942797290503650609…45022645117301875681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.188 × 10⁹⁸(99-digit number)
41885594581007301218…90045290234603751361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.377 × 10⁹⁸(99-digit number)
83771189162014602437…80090580469207502721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.675 × 10⁹⁹(100-digit number)
16754237832402920487…60181160938415005441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.350 × 10⁹⁹(100-digit number)
33508475664805840974…20362321876830010881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.701 × 10⁹⁹(100-digit number)
67016951329611681949…40724643753660021761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.340 × 10¹⁰⁰(101-digit number)
13403390265922336389…81449287507320043521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.680 × 10¹⁰⁰(101-digit number)
26806780531844672779…62898575014640087041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.361 × 10¹⁰⁰(101-digit number)
53613561063689345559…25797150029280174081
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,777,132 XPM·at block #6,816,625 · 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