Block #308,183

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/12/2013, 11:26:20 PM · Difficulty 9.9944 · 6,505,833 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b2011fc8a6f2692823125f60bffe6960bfefcc55edd0e9992638893da5083ae0

Height

#308,183

Difficulty

9.994432

Transactions

19

Size

9.38 KB

Version

2

Bits

09fe931d

Nonce

305,067

Timestamp

12/12/2013, 11:26:20 PM

Confirmations

6,505,833

Merkle Root

0205b825590448ae30db466ed29a5e437a3f18000128aea4e0fe35a67d95c0a0
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.

2.534 × 10⁹⁴(95-digit number)
25345977886728815008…99940737660366943599
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
2.534 × 10⁹⁴(95-digit number)
25345977886728815008…99940737660366943599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.069 × 10⁹⁴(95-digit number)
50691955773457630016…99881475320733887199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.013 × 10⁹⁵(96-digit number)
10138391154691526003…99762950641467774399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.027 × 10⁹⁵(96-digit number)
20276782309383052006…99525901282935548799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.055 × 10⁹⁵(96-digit number)
40553564618766104013…99051802565871097599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.110 × 10⁹⁵(96-digit number)
81107129237532208026…98103605131742195199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.622 × 10⁹⁶(97-digit number)
16221425847506441605…96207210263484390399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.244 × 10⁹⁶(97-digit number)
32442851695012883210…92414420526968780799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.488 × 10⁹⁶(97-digit number)
64885703390025766421…84828841053937561599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.297 × 10⁹⁷(98-digit number)
12977140678005153284…69657682107875123199
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,756,212 XPM·at block #6,814,015 · 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