Block #309,051

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/13/2013, 10:02:41 AM · Difficulty 9.9947 · 6,517,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
d84c26ae4e605a36329e713a58c029e434f406db45cbd919c8d5181ec1477218

Height

#309,051

Difficulty

9.994705

Transactions

5

Size

1.80 KB

Version

2

Bits

09fea4f8

Nonce

47,041

Timestamp

12/13/2013, 10:02:41 AM

Confirmations

6,517,713

Merkle Root

48e40eec912125525e58033e8c2f25e23404147b3f0def9fcdee2c74f71f9e7e
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.

3.031 × 10⁹⁷(98-digit number)
30315953991686115275…63736741650175999999
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
3.031 × 10⁹⁷(98-digit number)
30315953991686115275…63736741650175999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.063 × 10⁹⁷(98-digit number)
60631907983372230550…27473483300351999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.212 × 10⁹⁸(99-digit number)
12126381596674446110…54946966600703999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.425 × 10⁹⁸(99-digit number)
24252763193348892220…09893933201407999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.850 × 10⁹⁸(99-digit number)
48505526386697784440…19787866402815999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
9.701 × 10⁹⁸(99-digit number)
97011052773395568880…39575732805631999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.940 × 10⁹⁹(100-digit number)
19402210554679113776…79151465611263999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.880 × 10⁹⁹(100-digit number)
38804421109358227552…58302931222527999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
7.760 × 10⁹⁹(100-digit number)
77608842218716455104…16605862445055999999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.552 × 10¹⁰⁰(101-digit number)
15521768443743291020…33211724890111999999
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,858,272 XPM·at block #6,826,763 · 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