Block #303,669

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/10/2013, 12:22:43 PM · Difficulty 9.9931 · 6,505,342 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
39f9887172ea0774e6db5181cb79d3c93df1bf5a55e4155ef05d81f9b82c6af6

Height

#303,669

Difficulty

9.993083

Transactions

12

Size

6.09 KB

Version

2

Bits

09fe3ab4

Nonce

451,367

Timestamp

12/10/2013, 12:22:43 PM

Confirmations

6,505,342

Merkle Root

8d4f50b9b400fa9fda0d52bb4fd77ccf9ce0d7631f61bb2a56db66e49e1fc1c2
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.

7.086 × 10⁸⁸(89-digit number)
70868294322874432041…95588764697651471821
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
7.086 × 10⁸⁸(89-digit number)
70868294322874432041…95588764697651471821
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.417 × 10⁸⁹(90-digit number)
14173658864574886408…91177529395302943641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.834 × 10⁸⁹(90-digit number)
28347317729149772816…82355058790605887281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.669 × 10⁸⁹(90-digit number)
56694635458299545633…64710117581211774561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.133 × 10⁹⁰(91-digit number)
11338927091659909126…29420235162423549121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.267 × 10⁹⁰(91-digit number)
22677854183319818253…58840470324847098241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.535 × 10⁹⁰(91-digit number)
45355708366639636506…17680940649694196481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.071 × 10⁹⁰(91-digit number)
90711416733279273013…35361881299388392961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.814 × 10⁹¹(92-digit number)
18142283346655854602…70723762598776785921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.628 × 10⁹¹(92-digit number)
36284566693311709205…41447525197553571841
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,716,149 XPM·at block #6,809,010 · 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