Block #295,026

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/5/2013, 5:33:14 AM · Difficulty 9.9912 · 6,549,572 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8bc2dbd8d21e1009685cffaf34db4dc5425e4d1de1c099a4920e291839c38c3a

Height

#295,026

Difficulty

9.991195

Transactions

5

Size

1.08 KB

Version

2

Bits

09fdbef3

Nonce

86,146

Timestamp

12/5/2013, 5:33:14 AM

Confirmations

6,549,572

Merkle Root

21f316611db544b1e0f931c7a8ab3fa4455d63b51e660800b59593d599984724
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.196 × 10⁹³(94-digit number)
21962313351890908121…57505560696880830791
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.196 × 10⁹³(94-digit number)
21962313351890908121…57505560696880830791
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.392 × 10⁹³(94-digit number)
43924626703781816242…15011121393761661581
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.784 × 10⁹³(94-digit number)
87849253407563632484…30022242787523323161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.756 × 10⁹⁴(95-digit number)
17569850681512726496…60044485575046646321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.513 × 10⁹⁴(95-digit number)
35139701363025452993…20088971150093292641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.027 × 10⁹⁴(95-digit number)
70279402726050905987…40177942300186585281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.405 × 10⁹⁵(96-digit number)
14055880545210181197…80355884600373170561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.811 × 10⁹⁵(96-digit number)
28111761090420362395…60711769200746341121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.622 × 10⁹⁵(96-digit number)
56223522180840724790…21423538401492682241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.124 × 10⁹⁶(97-digit number)
11244704436168144958…42847076802985364481
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:58,001,193 XPM·at block #6,844,597 · 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