Block #321,402

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/20/2013, 7:26:38 AM · Difficulty 10.1885 · 6,503,409 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
494868b7d2ff95a3062b302583e3636c4267c74f56a8b4dadbe67f928bc3d849

Height

#321,402

Difficulty

10.188540

Transactions

14

Size

11.12 KB

Version

2

Bits

0a304423

Nonce

19,500

Timestamp

12/20/2013, 7:26:38 AM

Confirmations

6,503,409

Merkle Root

453baffcbb0e2e7e1ada1b706a2e9173d2e452cb6d93fa9a062f1c634254cdf5
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.

6.472 × 10¹⁰²(103-digit number)
64721118325356069153…87871171869107461121
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
6.472 × 10¹⁰²(103-digit number)
64721118325356069153…87871171869107461121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.294 × 10¹⁰³(104-digit number)
12944223665071213830…75742343738214922241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.588 × 10¹⁰³(104-digit number)
25888447330142427661…51484687476429844481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.177 × 10¹⁰³(104-digit number)
51776894660284855322…02969374952859688961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.035 × 10¹⁰⁴(105-digit number)
10355378932056971064…05938749905719377921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.071 × 10¹⁰⁴(105-digit number)
20710757864113942129…11877499811438755841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.142 × 10¹⁰⁴(105-digit number)
41421515728227884258…23754999622877511681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.284 × 10¹⁰⁴(105-digit number)
82843031456455768516…47509999245755023361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.656 × 10¹⁰⁵(106-digit number)
16568606291291153703…95019998491510046721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.313 × 10¹⁰⁵(106-digit number)
33137212582582307406…90039996983020093441
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,842,565 XPM·at block #6,824,810 · 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