Block #300,128

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/8/2013, 10:00:59 AM · Difficulty 9.9922 · 6,514,084 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b8f8474b19637f91ce857fc76a784ebc69d0167b4c42330713a8aec08f9b35af

Height

#300,128

Difficulty

9.992215

Transactions

8

Size

1.73 KB

Version

2

Bits

09fe01c9

Nonce

115,316

Timestamp

12/8/2013, 10:00:59 AM

Confirmations

6,514,084

Merkle Root

1fe567d579e83e69e3e820b306fcef83ec83ea8b77501a0398d3255162054dc1
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.180 × 10⁹⁷(98-digit number)
11804929233049089448…75031685824744012561
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.180 × 10⁹⁷(98-digit number)
11804929233049089448…75031685824744012561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.360 × 10⁹⁷(98-digit number)
23609858466098178897…50063371649488025121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.721 × 10⁹⁷(98-digit number)
47219716932196357794…00126743298976050241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.443 × 10⁹⁷(98-digit number)
94439433864392715588…00253486597952100481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.888 × 10⁹⁸(99-digit number)
18887886772878543117…00506973195904200961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.777 × 10⁹⁸(99-digit number)
37775773545757086235…01013946391808401921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.555 × 10⁹⁸(99-digit number)
75551547091514172470…02027892783616803841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.511 × 10⁹⁹(100-digit number)
15110309418302834494…04055785567233607681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.022 × 10⁹⁹(100-digit number)
30220618836605668988…08111571134467215361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.044 × 10⁹⁹(100-digit number)
60441237673211337976…16223142268934430721
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,757,764 XPM·at block #6,814,211 · 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