Block #294,681

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/5/2013, 12:20:31 AM · Difficulty 9.9911 · 6,521,941 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
62e9694ef08add75370b33247c32b0ea41caaaa45f88c499c1a711d0befaf95b

Height

#294,681

Difficulty

9.991130

Transactions

1

Size

1.15 KB

Version

2

Bits

09fdbab7

Nonce

146,022

Timestamp

12/5/2013, 12:20:31 AM

Confirmations

6,521,941

Merkle Root

22673303c769711134097a17602b9a846863849de5c6e619c85ac1a2a8211f57
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.

1.399 × 10⁹⁴(95-digit number)
13993502497533826774…90315647844437561121
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
1.399 × 10⁹⁴(95-digit number)
13993502497533826774…90315647844437561121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.798 × 10⁹⁴(95-digit number)
27987004995067653549…80631295688875122241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.597 × 10⁹⁴(95-digit number)
55974009990135307098…61262591377750244481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.119 × 10⁹⁵(96-digit number)
11194801998027061419…22525182755500488961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.238 × 10⁹⁵(96-digit number)
22389603996054122839…45050365511000977921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.477 × 10⁹⁵(96-digit number)
44779207992108245678…90100731022001955841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.955 × 10⁹⁵(96-digit number)
89558415984216491357…80201462044003911681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.791 × 10⁹⁶(97-digit number)
17911683196843298271…60402924088007823361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.582 × 10⁹⁶(97-digit number)
35823366393686596543…20805848176015646721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.164 × 10⁹⁶(97-digit number)
71646732787373193086…41611696352031293441
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,777,099 XPM·at block #6,816,621 · 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