Block #324,286

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/22/2013, 5:36:27 AM · Difficulty 10.2079 · 6,501,901 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
50a43394eb32e5432ee1d27543de4ebac2900f57a03b67e39d2e62f7c00da3c0

Height

#324,286

Difficulty

10.207866

Transactions

16

Size

5.06 KB

Version

2

Bits

0a3536b8

Nonce

4,108

Timestamp

12/22/2013, 5:36:27 AM

Confirmations

6,501,901

Merkle Root

20d9de0ad24b453f636ed9dd62249f3d59edb5cc92708d5067e0b26b574cc425
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.

5.722 × 10⁹⁷(98-digit number)
57225317807110229628…49933695746246525601
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
5.722 × 10⁹⁷(98-digit number)
57225317807110229628…49933695746246525601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.144 × 10⁹⁸(99-digit number)
11445063561422045925…99867391492493051201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.289 × 10⁹⁸(99-digit number)
22890127122844091851…99734782984986102401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.578 × 10⁹⁸(99-digit number)
45780254245688183703…99469565969972204801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.156 × 10⁹⁸(99-digit number)
91560508491376367406…98939131939944409601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.831 × 10⁹⁹(100-digit number)
18312101698275273481…97878263879888819201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.662 × 10⁹⁹(100-digit number)
36624203396550546962…95756527759777638401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.324 × 10⁹⁹(100-digit number)
73248406793101093924…91513055519555276801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.464 × 10¹⁰⁰(101-digit number)
14649681358620218784…83026111039110553601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.929 × 10¹⁰⁰(101-digit number)
29299362717240437569…66052222078221107201
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,853,626 XPM·at block #6,826,186 · 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