Block #486,400

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 4/11/2014, 1:56:51 PM · Difficulty 10.6254 · 6,330,476 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d9b2afdf693f1c92e0d3a9f1c0de5fa23a434a510c53e01155507a48c4628b17

Height

#486,400

Difficulty

10.625413

Transactions

4

Size

2.12 KB

Version

2

Bits

0aa01b19

Nonce

224,717

Timestamp

4/11/2014, 1:56:51 PM

Confirmations

6,330,476

Merkle Root

a704f6b9775d0f8127dd9901bd7d78506ead385d0c59e21eb91c90b834db11e0
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.075 × 10⁹⁶(97-digit number)
20757227624945530475…96430735624439781921
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.075 × 10⁹⁶(97-digit number)
20757227624945530475…96430735624439781921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.151 × 10⁹⁶(97-digit number)
41514455249891060950…92861471248879563841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.302 × 10⁹⁶(97-digit number)
83028910499782121901…85722942497759127681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.660 × 10⁹⁷(98-digit number)
16605782099956424380…71445884995518255361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.321 × 10⁹⁷(98-digit number)
33211564199912848760…42891769991036510721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.642 × 10⁹⁷(98-digit number)
66423128399825697520…85783539982073021441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.328 × 10⁹⁸(99-digit number)
13284625679965139504…71567079964146042881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.656 × 10⁹⁸(99-digit number)
26569251359930279008…43134159928292085761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.313 × 10⁹⁸(99-digit number)
53138502719860558016…86268319856584171521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.062 × 10⁹⁹(100-digit number)
10627700543972111603…72536639713168343041
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,779,046 XPM·at block #6,816,875 · 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