Block #533,179

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/9/2014, 1:11:40 PM · Difficulty 10.8993 · 6,280,853 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2dc3a7f81be911964fbd9649ed8719ac24bd379fdf433d332d6bfdf20758fd9d

Height

#533,179

Difficulty

10.899295

Transactions

5

Size

1.09 KB

Version

2

Bits

0ae63837

Nonce

89,938,888

Timestamp

5/9/2014, 1:11:40 PM

Confirmations

6,280,853

Merkle Root

a6c6633646ea1aa2bb815cb48ef6f3ef4e05f0b1a32752c84adf731deb35349d
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.871 × 10⁹⁹(100-digit number)
28717784043492675847…51080066379799468961
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.871 × 10⁹⁹(100-digit number)
28717784043492675847…51080066379799468961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.743 × 10⁹⁹(100-digit number)
57435568086985351694…02160132759598937921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.148 × 10¹⁰⁰(101-digit number)
11487113617397070338…04320265519197875841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.297 × 10¹⁰⁰(101-digit number)
22974227234794140677…08640531038395751681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.594 × 10¹⁰⁰(101-digit number)
45948454469588281355…17281062076791503361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.189 × 10¹⁰⁰(101-digit number)
91896908939176562711…34562124153583006721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.837 × 10¹⁰¹(102-digit number)
18379381787835312542…69124248307166013441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.675 × 10¹⁰¹(102-digit number)
36758763575670625084…38248496614332026881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.351 × 10¹⁰¹(102-digit number)
73517527151341250169…76496993228664053761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.470 × 10¹⁰²(103-digit number)
14703505430268250033…52993986457328107521
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,756,331 XPM·at block #6,814,031 · 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