Block #295,309

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/5/2013, 9:11:32 AM · Difficulty 9.9913 · 6,518,595 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6ec1f284d81d3244df2d13d294a4117548f57499f1f1a9cc59e52b939e5eba81

Height

#295,309

Difficulty

9.991324

Transactions

12

Size

3.78 KB

Version

2

Bits

09fdc766

Nonce

534,107

Timestamp

12/5/2013, 9:11:32 AM

Confirmations

6,518,595

Merkle Root

ce8ca5807eacbbea66e8371b25f7ba4e4c64b16877eb50228ff994f7fba3f724
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.309 × 10⁹⁰(91-digit number)
23099145339892045018…56361499625635349801
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.309 × 10⁹⁰(91-digit number)
23099145339892045018…56361499625635349801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.619 × 10⁹⁰(91-digit number)
46198290679784090037…12722999251270699601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.239 × 10⁹⁰(91-digit number)
92396581359568180075…25445998502541399201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.847 × 10⁹¹(92-digit number)
18479316271913636015…50891997005082798401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.695 × 10⁹¹(92-digit number)
36958632543827272030…01783994010165596801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.391 × 10⁹¹(92-digit number)
73917265087654544060…03567988020331193601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.478 × 10⁹²(93-digit number)
14783453017530908812…07135976040662387201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.956 × 10⁹²(93-digit number)
29566906035061817624…14271952081324774401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.913 × 10⁹²(93-digit number)
59133812070123635248…28543904162649548801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.182 × 10⁹³(94-digit number)
11826762414024727049…57087808325299097601
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,755,311 XPM·at block #6,813,903 · 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