Block #502,539

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/20/2014, 12:08:23 PM · Difficulty 10.8071 · 6,324,304 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dbd5e2f066995c5bf4e06ce046a968fca851327911ec2bce81ff7b8057e60036

Height

#502,539

Difficulty

10.807140

Transactions

3

Size

3.56 KB

Version

2

Bits

0acea0c1

Nonce

178,132,352

Timestamp

4/20/2014, 12:08:23 PM

Confirmations

6,324,304

Merkle Root

89588a4e5699e8bb750ef881beb440bb07f2837f43a7520f543103a6a229fdae
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.

4.788 × 10⁹⁸(99-digit number)
47888716659064210560…69169222402057204801
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
4.788 × 10⁹⁸(99-digit number)
47888716659064210560…69169222402057204801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.577 × 10⁹⁸(99-digit number)
95777433318128421120…38338444804114409601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.915 × 10⁹⁹(100-digit number)
19155486663625684224…76676889608228819201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.831 × 10⁹⁹(100-digit number)
38310973327251368448…53353779216457638401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.662 × 10⁹⁹(100-digit number)
76621946654502736896…06707558432915276801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.532 × 10¹⁰⁰(101-digit number)
15324389330900547379…13415116865830553601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.064 × 10¹⁰⁰(101-digit number)
30648778661801094758…26830233731661107201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.129 × 10¹⁰⁰(101-digit number)
61297557323602189517…53660467463322214401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.225 × 10¹⁰¹(102-digit number)
12259511464720437903…07320934926644428801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.451 × 10¹⁰¹(102-digit number)
24519022929440875806…14641869853288857601
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,858,909 XPM·at block #6,826,842 · 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