Block #337,926

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/1/2014, 1:39:41 AM · Difficulty 10.1261 · 6,471,466 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
63bc209a4e023af7ab2c84de549c19efe63f7181adef21bb51ec80617599e12d

Height

#337,926

Difficulty

10.126095

Transactions

9

Size

5.14 KB

Version

2

Bits

0a2047bd

Nonce

75,203

Timestamp

1/1/2014, 1:39:41 AM

Confirmations

6,471,466

Merkle Root

6454bc6a1e0b24255e093834e880c0c99a1503c3db29935c9c9b120e4b20de23
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.105 × 10⁹⁸(99-digit number)
11050378441989792374…39700322878619828641
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.105 × 10⁹⁸(99-digit number)
11050378441989792374…39700322878619828641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.210 × 10⁹⁸(99-digit number)
22100756883979584749…79400645757239657281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.420 × 10⁹⁸(99-digit number)
44201513767959169499…58801291514479314561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.840 × 10⁹⁸(99-digit number)
88403027535918338998…17602583028958629121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.768 × 10⁹⁹(100-digit number)
17680605507183667799…35205166057917258241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.536 × 10⁹⁹(100-digit number)
35361211014367335599…70410332115834516481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.072 × 10⁹⁹(100-digit number)
70722422028734671198…40820664231669032961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.414 × 10¹⁰⁰(101-digit number)
14144484405746934239…81641328463338065921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.828 × 10¹⁰⁰(101-digit number)
28288968811493868479…63282656926676131841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.657 × 10¹⁰⁰(101-digit number)
56577937622987736958…26565313853352263681
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,719,209 XPM·at block #6,809,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.

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