Block #302,041

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/9/2013, 2:16:42 PM · Difficulty 9.9926 · 6,513,006 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
59c2d9f30a00da5cf058810046cc8f7e2bc35c6795f7881e86fb989695e32e7d

Height

#302,041

Difficulty

9.992603

Transactions

11

Size

4.58 KB

Version

2

Bits

09fe1b39

Nonce

62,213

Timestamp

12/9/2013, 2:16:42 PM

Confirmations

6,513,006

Merkle Root

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

4.902 × 10⁹¹(92-digit number)
49021268426238196446…05831289849659024001
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
4.902 × 10⁹¹(92-digit number)
49021268426238196446…05831289849659024001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.804 × 10⁹¹(92-digit number)
98042536852476392892…11662579699318048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.960 × 10⁹²(93-digit number)
19608507370495278578…23325159398636096001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.921 × 10⁹²(93-digit number)
39217014740990557156…46650318797272192001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.843 × 10⁹²(93-digit number)
78434029481981114313…93300637594544384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.568 × 10⁹³(94-digit number)
15686805896396222862…86601275189088768001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.137 × 10⁹³(94-digit number)
31373611792792445725…73202550378177536001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.274 × 10⁹³(94-digit number)
62747223585584891451…46405100756355072001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.254 × 10⁹⁴(95-digit number)
12549444717116978290…92810201512710144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.509 × 10⁹⁴(95-digit number)
25098889434233956580…85620403025420288001
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,764,466 XPM·at block #6,815,046 · 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