Block #325,010

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/22/2013, 5:41:03 PM · Difficulty 10.2078 · 6,499,686 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8821cfc8426c1de43204ac3172edd8c7542c27b9f057b9b9f5617e2e58049ca1

Height

#325,010

Difficulty

10.207839

Transactions

2

Size

430 B

Version

2

Bits

0a3534f4

Nonce

27,158

Timestamp

12/22/2013, 5:41:03 PM

Confirmations

6,499,686

Merkle Root

d1370972c34efe769234f393b5d13fd005fc99e7e64b118feda054a85b3ce879
Transactions (2)
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.369 × 10¹⁰⁷(108-digit number)
53697599030858541990…48566092033694704799
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.369 × 10¹⁰⁷(108-digit number)
53697599030858541990…48566092033694704799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.073 × 10¹⁰⁸(109-digit number)
10739519806171708398…97132184067389409599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.147 × 10¹⁰⁸(109-digit number)
21479039612343416796…94264368134778819199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.295 × 10¹⁰⁸(109-digit number)
42958079224686833592…88528736269557638399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.591 × 10¹⁰⁸(109-digit number)
85916158449373667185…77057472539115276799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.718 × 10¹⁰⁹(110-digit number)
17183231689874733437…54114945078230553599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.436 × 10¹⁰⁹(110-digit number)
34366463379749466874…08229890156461107199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.873 × 10¹⁰⁹(110-digit number)
68732926759498933748…16459780312922214399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.374 × 10¹¹⁰(111-digit number)
13746585351899786749…32919560625844428799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.749 × 10¹¹⁰(111-digit number)
27493170703799573499…65839121251688857599
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,841,634 XPM·at block #6,824,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.
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