Block #324,654

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/22/2013, 11:53:37 AM · Difficulty 10.2063 · 6,515,713 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9c3c05c8f347e50c0eb45f195c79aaf33a126d757e310995d029ef1d00d0516a

Height

#324,654

Difficulty

10.206299

Transactions

11

Size

3.42 KB

Version

2

Bits

0a34d009

Nonce

15,122

Timestamp

12/22/2013, 11:53:37 AM

Confirmations

6,515,713

Merkle Root

eb9c8b3cdc07e3c1d9bad1361bda7bec87dc4b180861ae99c1cdc7bbe70b1241
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.

8.192 × 10¹⁰¹(102-digit number)
81924235205591115236…82092856505440349439
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
8.192 × 10¹⁰¹(102-digit number)
81924235205591115236…82092856505440349439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.638 × 10¹⁰²(103-digit number)
16384847041118223047…64185713010880698879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.276 × 10¹⁰²(103-digit number)
32769694082236446094…28371426021761397759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.553 × 10¹⁰²(103-digit number)
65539388164472892189…56742852043522795519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.310 × 10¹⁰³(104-digit number)
13107877632894578437…13485704087045591039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.621 × 10¹⁰³(104-digit number)
26215755265789156875…26971408174091182079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.243 × 10¹⁰³(104-digit number)
52431510531578313751…53942816348182364159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.048 × 10¹⁰⁴(105-digit number)
10486302106315662750…07885632696364728319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.097 × 10¹⁰⁴(105-digit number)
20972604212631325500…15771265392729456639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.194 × 10¹⁰⁴(105-digit number)
41945208425262651000…31542530785458913279
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,967,254 XPM·at block #6,840,366 · 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