Block #297,778

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/6/2013, 7:47:17 PM · Difficulty 9.9920 · 6,511,372 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9dc757f68d1734a8083483239a86509a22960608efa6fe3bd3291d53344d9b87

Height

#297,778

Difficulty

9.992049

Transactions

15

Size

18.03 KB

Version

2

Bits

09fdf6f0

Nonce

45,152

Timestamp

12/6/2013, 7:47:17 PM

Confirmations

6,511,372

Merkle Root

547411f22df17a6bce3df987f643c368019464844c999ec46b6106533d6b1aa8
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.

8.831 × 10⁹³(94-digit number)
88316880309729852670…68904583239215618561
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
8.831 × 10⁹³(94-digit number)
88316880309729852670…68904583239215618561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.766 × 10⁹⁴(95-digit number)
17663376061945970534…37809166478431237121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.532 × 10⁹⁴(95-digit number)
35326752123891941068…75618332956862474241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.065 × 10⁹⁴(95-digit number)
70653504247783882136…51236665913724948481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.413 × 10⁹⁵(96-digit number)
14130700849556776427…02473331827449896961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.826 × 10⁹⁵(96-digit number)
28261401699113552854…04946663654899793921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.652 × 10⁹⁵(96-digit number)
56522803398227105709…09893327309799587841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.130 × 10⁹⁶(97-digit number)
11304560679645421141…19786654619599175681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.260 × 10⁹⁶(97-digit number)
22609121359290842283…39573309239198351361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.521 × 10⁹⁶(97-digit number)
45218242718581684567…79146618478396702721
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,717,263 XPM·at block #6,809,149 · 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