Block #321,333

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/20/2013, 6:11:50 AM · Difficulty 10.1898 · 6,488,363 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f5091782ee8f4f278e430c3bcb00eedc89a23d405ca86973560060876010d809

Height

#321,333

Difficulty

10.189812

Transactions

9

Size

52.13 KB

Version

2

Bits

0a309787

Nonce

129,943

Timestamp

12/20/2013, 6:11:50 AM

Confirmations

6,488,363

Merkle Root

5b185ef74e6fcf1cf049271eab2d040645f5c0a66c305ebb534cb6e62a4a9400
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.931 × 10⁹⁶(97-digit number)
49313923570387927471…73197662049895038961
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.931 × 10⁹⁶(97-digit number)
49313923570387927471…73197662049895038961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.862 × 10⁹⁶(97-digit number)
98627847140775854943…46395324099790077921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.972 × 10⁹⁷(98-digit number)
19725569428155170988…92790648199580155841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.945 × 10⁹⁷(98-digit number)
39451138856310341977…85581296399160311681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.890 × 10⁹⁷(98-digit number)
78902277712620683954…71162592798320623361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.578 × 10⁹⁸(99-digit number)
15780455542524136790…42325185596641246721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.156 × 10⁹⁸(99-digit number)
31560911085048273581…84650371193282493441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.312 × 10⁹⁸(99-digit number)
63121822170096547163…69300742386564986881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.262 × 10⁹⁹(100-digit number)
12624364434019309432…38601484773129973761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.524 × 10⁹⁹(100-digit number)
25248728868038618865…77202969546259947521
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,721,645 XPM·at block #6,809,695 · 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