Block #466,785

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/30/2014, 9:27:32 AM · Difficulty 10.4273 · 6,343,470 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4515f22eba31e972465176273bf7af3ae6cd59359d33ba7ec92910d3ce32510a

Height

#466,785

Difficulty

10.427258

Transactions

10

Size

17.36 KB

Version

2

Bits

0a6d60cf

Nonce

101,477

Timestamp

3/30/2014, 9:27:32 AM

Confirmations

6,343,470

Merkle Root

22cda5560b36d6c2ed62a30f61005901935c11fc4072a55bc6bc115388231adf
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.

8.458 × 10⁹⁵(96-digit number)
84588758744682595481…35735602239219635201
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
8.458 × 10⁹⁵(96-digit number)
84588758744682595481…35735602239219635201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.691 × 10⁹⁶(97-digit number)
16917751748936519096…71471204478439270401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.383 × 10⁹⁶(97-digit number)
33835503497873038192…42942408956878540801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.767 × 10⁹⁶(97-digit number)
67671006995746076385…85884817913757081601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.353 × 10⁹⁷(98-digit number)
13534201399149215277…71769635827514163201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.706 × 10⁹⁷(98-digit number)
27068402798298430554…43539271655028326401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.413 × 10⁹⁷(98-digit number)
54136805596596861108…87078543310056652801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.082 × 10⁹⁸(99-digit number)
10827361119319372221…74157086620113305601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.165 × 10⁹⁸(99-digit number)
21654722238638744443…48314173240226611201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.330 × 10⁹⁸(99-digit number)
43309444477277488886…96628346480453222401
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,726,113 XPM·at block #6,810,254 · 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