Block #294,104

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/4/2013, 4:47:44 PM · Difficulty 9.9909 · 6,520,110 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
63b17c7fd5680b119b758bcd9852dd8b2ecf1022620f224f50c4b0e5d29d0bca

Height

#294,104

Difficulty

9.990887

Transactions

26

Size

14.50 KB

Version

2

Bits

09fdaacb

Nonce

10,334

Timestamp

12/4/2013, 4:47:44 PM

Confirmations

6,520,110

Merkle Root

3f21fc1f6388b60b9daad08957dd910ac494635802993f98bd9cb048a82901cb
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.030 × 10⁹³(94-digit number)
30306319939387688649…69880619817083200001
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.030 × 10⁹³(94-digit number)
30306319939387688649…69880619817083200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.061 × 10⁹³(94-digit number)
60612639878775377299…39761239634166400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.212 × 10⁹⁴(95-digit number)
12122527975755075459…79522479268332800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.424 × 10⁹⁴(95-digit number)
24245055951510150919…59044958536665600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.849 × 10⁹⁴(95-digit number)
48490111903020301839…18089917073331200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.698 × 10⁹⁴(95-digit number)
96980223806040603679…36179834146662400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.939 × 10⁹⁵(96-digit number)
19396044761208120735…72359668293324800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.879 × 10⁹⁵(96-digit number)
38792089522416241471…44719336586649600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.758 × 10⁹⁵(96-digit number)
77584179044832482943…89438673173299200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.551 × 10⁹⁶(97-digit number)
15516835808966496588…78877346346598400001
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,757,780 XPM·at block #6,814,213 · 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