Block #302,494

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/9/2013, 8:27:22 PM · Difficulty 9.9927 · 6,513,524 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e0ff6472ece79e45e5fddcc42d660c88b5994703319fe160fa4c2e2c94153f16

Height

#302,494

Difficulty

9.992735

Transactions

2

Size

1.30 KB

Version

2

Bits

09fe23e9

Nonce

217,971

Timestamp

12/9/2013, 8:27:22 PM

Confirmations

6,513,524

Merkle Root

76b35877f45627523dbe025a9fc96d1bf4826148d5f9ab67e5556768505cd3f4
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.

9.801 × 10⁸⁹(90-digit number)
98016605922581427823…92727292557612202201
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
9.801 × 10⁸⁹(90-digit number)
98016605922581427823…92727292557612202201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.960 × 10⁹⁰(91-digit number)
19603321184516285564…85454585115224404401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.920 × 10⁹⁰(91-digit number)
39206642369032571129…70909170230448808801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.841 × 10⁹⁰(91-digit number)
78413284738065142258…41818340460897617601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.568 × 10⁹¹(92-digit number)
15682656947613028451…83636680921795235201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.136 × 10⁹¹(92-digit number)
31365313895226056903…67273361843590470401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.273 × 10⁹¹(92-digit number)
62730627790452113806…34546723687180940801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.254 × 10⁹²(93-digit number)
12546125558090422761…69093447374361881601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.509 × 10⁹²(93-digit number)
25092251116180845522…38186894748723763201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.018 × 10⁹²(93-digit number)
50184502232361691045…76373789497447526401
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,772,255 XPM·at block #6,816,017 · 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