Block #295,860

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/5/2013, 4:20:25 PM · Difficulty 9.9915 · 6,511,988 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0522f2ff4a5c76082f88d23896400527236a01e7dd03bf76518472ebdbd8a290

Height

#295,860

Difficulty

9.991521

Transactions

8

Size

3.34 KB

Version

2

Bits

09fdd453

Nonce

242,519

Timestamp

12/5/2013, 4:20:25 PM

Confirmations

6,511,988

Merkle Root

4a6929b960a5d5e6055e92c6623cb4ee4eb239b362937fd1e393901259b6f1f8
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.806 × 10⁹⁶(97-digit number)
28068425615647905948…91115485222535411341
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.806 × 10⁹⁶(97-digit number)
28068425615647905948…91115485222535411341
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.613 × 10⁹⁶(97-digit number)
56136851231295811897…82230970445070822681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.122 × 10⁹⁷(98-digit number)
11227370246259162379…64461940890141645361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.245 × 10⁹⁷(98-digit number)
22454740492518324758…28923881780283290721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.490 × 10⁹⁷(98-digit number)
44909480985036649517…57847763560566581441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.981 × 10⁹⁷(98-digit number)
89818961970073299035…15695527121133162881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.796 × 10⁹⁸(99-digit number)
17963792394014659807…31391054242266325761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.592 × 10⁹⁸(99-digit number)
35927584788029319614…62782108484532651521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.185 × 10⁹⁸(99-digit number)
71855169576058639228…25564216969065303041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.437 × 10⁹⁹(100-digit number)
14371033915211727845…51128433938130606081
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,706,823 XPM·at block #6,807,847 · 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.

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