Block #295,915

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/5/2013, 5:11:48 PM · Difficulty 9.9916 · 6,512,392 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
60dbe6c3d0c5181ef14851537f31853af631eec91335850eaccc24b00c8494d2

Height

#295,915

Difficulty

9.991556

Transactions

5

Size

1.37 KB

Version

2

Bits

09fdd6a0

Nonce

17,646

Timestamp

12/5/2013, 5:11:48 PM

Confirmations

6,512,392

Merkle Root

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

3.465 × 10⁹⁶(97-digit number)
34658725387596287099…62622845133442748161
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
3.465 × 10⁹⁶(97-digit number)
34658725387596287099…62622845133442748161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.931 × 10⁹⁶(97-digit number)
69317450775192574199…25245690266885496321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.386 × 10⁹⁷(98-digit number)
13863490155038514839…50491380533770992641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.772 × 10⁹⁷(98-digit number)
27726980310077029679…00982761067541985281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.545 × 10⁹⁷(98-digit number)
55453960620154059359…01965522135083970561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.109 × 10⁹⁸(99-digit number)
11090792124030811871…03931044270167941121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.218 × 10⁹⁸(99-digit number)
22181584248061623743…07862088540335882241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.436 × 10⁹⁸(99-digit number)
44363168496123247487…15724177080671764481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.872 × 10⁹⁸(99-digit number)
88726336992246494975…31448354161343528961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.774 × 10⁹⁹(100-digit number)
17745267398449298995…62896708322687057921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.549 × 10⁹⁹(100-digit number)
35490534796898597990…25793416645374115841
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,710,511 XPM·at block #6,808,306 · 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