Block #303,347

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/10/2013, 8:10:04 AM · Difficulty 9.9930 · 6,506,250 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
3b0ae10c96b1877860e18d75935497a0d980c0b99a16d16613d545377d1fa24d

Height

#303,347

Difficulty

9.992976

Transactions

8

Size

2.45 KB

Version

2

Bits

09fe33a6

Nonce

17,121

Timestamp

12/10/2013, 8:10:04 AM

Confirmations

6,506,250

Merkle Root

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

1.953 × 10⁹⁶(97-digit number)
19531991333883654855…86003616867455846399
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
1.953 × 10⁹⁶(97-digit number)
19531991333883654855…86003616867455846399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.906 × 10⁹⁶(97-digit number)
39063982667767309710…72007233734911692799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.812 × 10⁹⁶(97-digit number)
78127965335534619421…44014467469823385599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.562 × 10⁹⁷(98-digit number)
15625593067106923884…88028934939646771199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.125 × 10⁹⁷(98-digit number)
31251186134213847768…76057869879293542399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.250 × 10⁹⁷(98-digit number)
62502372268427695536…52115739758587084799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.250 × 10⁹⁸(99-digit number)
12500474453685539107…04231479517174169599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.500 × 10⁹⁸(99-digit number)
25000948907371078214…08462959034348339199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.000 × 10⁹⁸(99-digit number)
50001897814742156429…16925918068696678399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.000 × 10⁹⁹(100-digit number)
10000379562948431285…33851836137393356799
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,720,850 XPM·at block #6,809,596 · 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.

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