Block #295,324

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/5/2013, 9:19:53 AM · Difficulty 9.9913 · 6,514,589 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
89ee382ba35d1298bb135b303cd1c2eb487c819507ba0e442b7c57d0245ec3e2

Height

#295,324

Difficulty

9.991334

Transactions

16

Size

25.96 KB

Version

2

Bits

09fdc80a

Nonce

43,272

Timestamp

12/5/2013, 9:19:53 AM

Confirmations

6,514,589

Merkle Root

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

5.106 × 10⁹⁵(96-digit number)
51064866491423764098…55596078381713894401
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
5.106 × 10⁹⁵(96-digit number)
51064866491423764098…55596078381713894401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.021 × 10⁹⁶(97-digit number)
10212973298284752819…11192156763427788801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.042 × 10⁹⁶(97-digit number)
20425946596569505639…22384313526855577601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.085 × 10⁹⁶(97-digit number)
40851893193139011278…44768627053711155201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.170 × 10⁹⁶(97-digit number)
81703786386278022556…89537254107422310401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.634 × 10⁹⁷(98-digit number)
16340757277255604511…79074508214844620801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.268 × 10⁹⁷(98-digit number)
32681514554511209022…58149016429689241601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.536 × 10⁹⁷(98-digit number)
65363029109022418045…16298032859378483201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.307 × 10⁹⁸(99-digit number)
13072605821804483609…32596065718756966401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.614 × 10⁹⁸(99-digit number)
26145211643608967218…65192131437513932801
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,723,388 XPM·at block #6,809,912 · 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