Block #299,006

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/7/2013, 4:46:07 PM · Difficulty 9.9920 · 6,525,583 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3dcc0a4e7b4f13fd04011aa6b407c4b801c6ee7d3bdbc3c90dd30235bd04669b

Height

#299,006

Difficulty

9.992042

Transactions

12

Size

7.21 KB

Version

2

Bits

09fdf67a

Nonce

107,118

Timestamp

12/7/2013, 4:46:07 PM

Confirmations

6,525,583

Merkle Root

10d3178daf04a0ccddb27376e4fdce6910b1736709d99ee87e8bedbf69025ebe
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.061 × 10⁹²(93-digit number)
10616351340209685923…42379787941228305101
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.061 × 10⁹²(93-digit number)
10616351340209685923…42379787941228305101
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.123 × 10⁹²(93-digit number)
21232702680419371846…84759575882456610201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.246 × 10⁹²(93-digit number)
42465405360838743693…69519151764913220401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.493 × 10⁹²(93-digit number)
84930810721677487387…39038303529826440801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.698 × 10⁹³(94-digit number)
16986162144335497477…78076607059652881601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.397 × 10⁹³(94-digit number)
33972324288670994954…56153214119305763201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.794 × 10⁹³(94-digit number)
67944648577341989909…12306428238611526401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.358 × 10⁹⁴(95-digit number)
13588929715468397981…24612856477223052801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.717 × 10⁹⁴(95-digit number)
27177859430936795963…49225712954446105601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.435 × 10⁹⁴(95-digit number)
54355718861873591927…98451425908892211201
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,840,780 XPM·at block #6,824,588 · 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