Block #295,398

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/5/2013, 10:21:49 AM · Difficulty 9.9914 · 6,518,990 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
72808d4f1144d23a52566d16c9c7a9e912f7becccc7b53efc0e4590a04ff3605

Height

#295,398

Difficulty

9.991358

Transactions

4

Size

1.84 KB

Version

2

Bits

09fdc9aa

Nonce

310,556

Timestamp

12/5/2013, 10:21:49 AM

Confirmations

6,518,990

Merkle Root

5ea730d05734c2d806d42c1ba10bd42d4aea8c94607aaec6ecec6009be3fb0c0
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.063 × 10⁹¹(92-digit number)
20632859912305978983…03134227904539939251
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.063 × 10⁹¹(92-digit number)
20632859912305978983…03134227904539939251
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.126 × 10⁹¹(92-digit number)
41265719824611957967…06268455809079878501
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.253 × 10⁹¹(92-digit number)
82531439649223915935…12536911618159757001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.650 × 10⁹²(93-digit number)
16506287929844783187…25073823236319514001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.301 × 10⁹²(93-digit number)
33012575859689566374…50147646472639028001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.602 × 10⁹²(93-digit number)
66025151719379132748…00295292945278056001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.320 × 10⁹³(94-digit number)
13205030343875826549…00590585890556112001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.641 × 10⁹³(94-digit number)
26410060687751653099…01181171781112224001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.282 × 10⁹³(94-digit number)
52820121375503306198…02362343562224448001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.056 × 10⁹⁴(95-digit number)
10564024275100661239…04724687124448896001
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,759,165 XPM·at block #6,814,387 · 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