Block #467,326

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 3/30/2014, 5:05:48 PM · Difficulty 10.4365 · 6,357,704 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
94c002d00d92c07ecd68bdf4b5b7701f04caee147f044b7648de4cfddfbf52df

Height

#467,326

Difficulty

10.436457

Transactions

2

Size

1.78 KB

Version

2

Bits

0a6fbbaa

Nonce

36,973

Timestamp

3/30/2014, 5:05:48 PM

Confirmations

6,357,704

Merkle Root

3024546b93b7456d61281b062786a53d6e8e9a4997d5a24118de04f19c604501
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.514 × 10⁹¹(92-digit number)
25148646491090280847…14496337233469235961
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.514 × 10⁹¹(92-digit number)
25148646491090280847…14496337233469235961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.029 × 10⁹¹(92-digit number)
50297292982180561695…28992674466938471921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.005 × 10⁹²(93-digit number)
10059458596436112339…57985348933876943841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.011 × 10⁹²(93-digit number)
20118917192872224678…15970697867753887681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.023 × 10⁹²(93-digit number)
40237834385744449356…31941395735507775361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.047 × 10⁹²(93-digit number)
80475668771488898712…63882791471015550721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.609 × 10⁹³(94-digit number)
16095133754297779742…27765582942031101441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.219 × 10⁹³(94-digit number)
32190267508595559485…55531165884062202881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.438 × 10⁹³(94-digit number)
64380535017191118970…11062331768124405761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.287 × 10⁹⁴(95-digit number)
12876107003438223794…22124663536248811521
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,844,323 XPM·at block #6,825,029 · 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