Block #326,369

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/23/2013, 6:19:59 PM · Difficulty 10.1892 · 6,486,467 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
24fdbd139217d890d5528c1ff5d48e2a3467754e2c0b77f42bed6764ffa72d1c

Height

#326,369

Difficulty

10.189186

Transactions

23

Size

6.14 KB

Version

2

Bits

0a306e86

Nonce

14,575

Timestamp

12/23/2013, 6:19:59 PM

Confirmations

6,486,467

Merkle Root

5bd44d80fdedce1438e1f4cf57c97c0301cecef52a344cdd8981a92a601ba7b5
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.534 × 10¹⁰³(104-digit number)
65342397317493806245…08445863305693001359
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.534 × 10¹⁰³(104-digit number)
65342397317493806245…08445863305693001359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.306 × 10¹⁰⁴(105-digit number)
13068479463498761249…16891726611386002719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.613 × 10¹⁰⁴(105-digit number)
26136958926997522498…33783453222772005439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.227 × 10¹⁰⁴(105-digit number)
52273917853995044996…67566906445544010879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.045 × 10¹⁰⁵(106-digit number)
10454783570799008999…35133812891088021759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.090 × 10¹⁰⁵(106-digit number)
20909567141598017998…70267625782176043519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.181 × 10¹⁰⁵(106-digit number)
41819134283196035997…40535251564352087039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.363 × 10¹⁰⁵(106-digit number)
83638268566392071994…81070503128704174079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.672 × 10¹⁰⁶(107-digit number)
16727653713278414398…62141006257408348159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.345 × 10¹⁰⁶(107-digit number)
33455307426556828797…24282012514816696319
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,746,733 XPM·at block #6,812,835 · 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