Block #328,217

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/25/2013, 2:50:11 AM · Difficulty 10.1728 · 6,489,757 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bf37f877175130861f0bcce912f747fa02beac9177f0222457b30a813216659d

Height

#328,217

Difficulty

10.172773

Transactions

4

Size

877 B

Version

2

Bits

0a2c3ae2

Nonce

160,913

Timestamp

12/25/2013, 2:50:11 AM

Confirmations

6,489,757

Merkle Root

5f834e300b58cd320a1479d4df0ca0e1313a519a39ceae39832b623f8d2f4d0d
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.960 × 10⁹⁵(96-digit number)
89601984133460743624…04804248247012495359
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.960 × 10⁹⁵(96-digit number)
89601984133460743624…04804248247012495359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.792 × 10⁹⁶(97-digit number)
17920396826692148724…09608496494024990719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.584 × 10⁹⁶(97-digit number)
35840793653384297449…19216992988049981439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.168 × 10⁹⁶(97-digit number)
71681587306768594899…38433985976099962879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.433 × 10⁹⁷(98-digit number)
14336317461353718979…76867971952199925759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.867 × 10⁹⁷(98-digit number)
28672634922707437959…53735943904399851519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.734 × 10⁹⁷(98-digit number)
57345269845414875919…07471887808799703039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.146 × 10⁹⁸(99-digit number)
11469053969082975183…14943775617599406079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.293 × 10⁹⁸(99-digit number)
22938107938165950367…29887551235198812159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.587 × 10⁹⁸(99-digit number)
45876215876331900735…59775102470397624319
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,787,863 XPM·at block #6,817,973 · 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