Block #299,811

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/8/2013, 5:26:06 AM · Difficulty 9.9921 · 6,518,010 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
2766cb241c8a592ff85e4574c3b368ef2e78780416ef6a203f025470d6fc0dc5

Height

#299,811

Difficulty

9.992139

Transactions

18

Size

4.38 KB

Version

2

Bits

09fdfccc

Nonce

34,280

Timestamp

12/8/2013, 5:26:06 AM

Confirmations

6,518,010

Merkle Root

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

2.081 × 10⁹³(94-digit number)
20816315922058857638…02763772194466468141
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
2.081 × 10⁹³(94-digit number)
20816315922058857638…02763772194466468141
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.163 × 10⁹³(94-digit number)
41632631844117715276…05527544388932936281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.326 × 10⁹³(94-digit number)
83265263688235430553…11055088777865872561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.665 × 10⁹⁴(95-digit number)
16653052737647086110…22110177555731745121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.330 × 10⁹⁴(95-digit number)
33306105475294172221…44220355111463490241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.661 × 10⁹⁴(95-digit number)
66612210950588344442…88440710222926980481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.332 × 10⁹⁵(96-digit number)
13322442190117668888…76881420445853960961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.664 × 10⁹⁵(96-digit number)
26644884380235337777…53762840891707921921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.328 × 10⁹⁵(96-digit number)
53289768760470675554…07525681783415843841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.065 × 10⁹⁶(97-digit number)
10657953752094135110…15051363566831687681
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,786,631 XPM·at block #6,817,820 · 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