Block #328,244

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/25/2013, 3:26:42 AM · Difficulty 10.1713 · 6,497,460 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
03e4535729603d3b91e67f93711c06f070baa8c0b1943f9c8e598091f41fedbb

Height

#328,244

Difficulty

10.171330

Transactions

6

Size

2.41 KB

Version

2

Bits

0a2bdc4a

Nonce

338,927

Timestamp

12/25/2013, 3:26:42 AM

Confirmations

6,497,460

Merkle Root

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

4.991 × 10⁹⁸(99-digit number)
49913633686926614162…56938076692918411279
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
4.991 × 10⁹⁸(99-digit number)
49913633686926614162…56938076692918411279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.982 × 10⁹⁸(99-digit number)
99827267373853228325…13876153385836822559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.996 × 10⁹⁹(100-digit number)
19965453474770645665…27752306771673645119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.993 × 10⁹⁹(100-digit number)
39930906949541291330…55504613543347290239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.986 × 10⁹⁹(100-digit number)
79861813899082582660…11009227086694580479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.597 × 10¹⁰⁰(101-digit number)
15972362779816516532…22018454173389160959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.194 × 10¹⁰⁰(101-digit number)
31944725559633033064…44036908346778321919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.388 × 10¹⁰⁰(101-digit number)
63889451119266066128…88073816693556643839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.277 × 10¹⁰¹(102-digit number)
12777890223853213225…76147633387113287679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.555 × 10¹⁰¹(102-digit number)
25555780447706426451…52295266774226575359
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,849,735 XPM·at block #6,825,703 · 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