Block #321,856

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/20/2013, 1:58:46 PM · Difficulty 10.1990 · 6,487,556 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0bed53f4008b659aeee4ba67e2e10d78a8595272834cfbfe7bf10ca258c32100

Height

#321,856

Difficulty

10.199023

Transactions

8

Size

14.27 KB

Version

2

Bits

0a32f334

Nonce

98,941

Timestamp

12/20/2013, 1:58:46 PM

Confirmations

6,487,556

Merkle Root

80e39e0cff81a11e02031ada0e2544e1fd9d15f21430b332889e12476d64253f
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.

1.520 × 10⁹⁷(98-digit number)
15203855632377423314…84835380692534804481
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
1.520 × 10⁹⁷(98-digit number)
15203855632377423314…84835380692534804481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.040 × 10⁹⁷(98-digit number)
30407711264754846628…69670761385069608961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.081 × 10⁹⁷(98-digit number)
60815422529509693256…39341522770139217921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.216 × 10⁹⁸(99-digit number)
12163084505901938651…78683045540278435841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.432 × 10⁹⁸(99-digit number)
24326169011803877302…57366091080556871681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.865 × 10⁹⁸(99-digit number)
48652338023607754604…14732182161113743361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.730 × 10⁹⁸(99-digit number)
97304676047215509209…29464364322227486721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.946 × 10⁹⁹(100-digit number)
19460935209443101841…58928728644454973441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.892 × 10⁹⁹(100-digit number)
38921870418886203683…17857457288909946881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.784 × 10⁹⁹(100-digit number)
77843740837772407367…35714914577819893761
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,719,371 XPM·at block #6,809,411 · 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