Block #300,814

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/8/2013, 7:31:27 PM · Difficulty 9.9924 · 6,513,578 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a291aafa870e1e74587866fa607b41196d4ae24bd723c7ac50e7529452fd5d45

Height

#300,814

Difficulty

9.992411

Transactions

1

Size

1.08 KB

Version

2

Bits

09fe0ea1

Nonce

2,523

Timestamp

12/8/2013, 7:31:27 PM

Confirmations

6,513,578

Merkle Root

87c56b57632c3de105266986952e93e16a99747c1b4b7040dac105a9e3cd86af
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.073 × 10⁹⁴(95-digit number)
10738044403457397675…90943185446488296001
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.073 × 10⁹⁴(95-digit number)
10738044403457397675…90943185446488296001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.147 × 10⁹⁴(95-digit number)
21476088806914795350…81886370892976592001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.295 × 10⁹⁴(95-digit number)
42952177613829590700…63772741785953184001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.590 × 10⁹⁴(95-digit number)
85904355227659181400…27545483571906368001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.718 × 10⁹⁵(96-digit number)
17180871045531836280…55090967143812736001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.436 × 10⁹⁵(96-digit number)
34361742091063672560…10181934287625472001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.872 × 10⁹⁵(96-digit number)
68723484182127345120…20363868575250944001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.374 × 10⁹⁶(97-digit number)
13744696836425469024…40727737150501888001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.748 × 10⁹⁶(97-digit number)
27489393672850938048…81455474301003776001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.497 × 10⁹⁶(97-digit number)
54978787345701876096…62910948602007552001
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,759,198 XPM·at block #6,814,391 · 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