Block #300,957

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/8/2013, 9:17:57 PM · Difficulty 9.9925 · 6,516,857 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a039c5731dad448e79f88801d6e6c4530f304876edeb10238d23ea3c72f0c06a

Height

#300,957

Difficulty

9.992464

Transactions

1

Size

933 B

Version

2

Bits

09fe1219

Nonce

48,461

Timestamp

12/8/2013, 9:17:57 PM

Confirmations

6,516,857

Merkle Root

6a8bb17b0c07961bd01a97daa5cb6eb574474435672736a651ea520d709da2e4
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.027 × 10⁹⁰(91-digit number)
20273889291994734299…19538042298181088001
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.027 × 10⁹⁰(91-digit number)
20273889291994734299…19538042298181088001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.054 × 10⁹⁰(91-digit number)
40547778583989468599…39076084596362176001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.109 × 10⁹⁰(91-digit number)
81095557167978937199…78152169192724352001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.621 × 10⁹¹(92-digit number)
16219111433595787439…56304338385448704001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.243 × 10⁹¹(92-digit number)
32438222867191574879…12608676770897408001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.487 × 10⁹¹(92-digit number)
64876445734383149759…25217353541794816001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.297 × 10⁹²(93-digit number)
12975289146876629951…50434707083589632001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.595 × 10⁹²(93-digit number)
25950578293753259903…00869414167179264001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.190 × 10⁹²(93-digit number)
51901156587506519807…01738828334358528001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.038 × 10⁹³(94-digit number)
10380231317501303961…03477656668717056001
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,786,574 XPM·at block #6,817,813 · 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