Block #370,998

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/22/2014, 1:20:41 PM · Difficulty 10.4363 · 6,436,444 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4f51ea381a09609e49b0d7e2610f2e97fe90599528304d6860da4fe689bb5c88

Height

#370,998

Difficulty

10.436328

Transactions

5

Size

1.08 KB

Version

2

Bits

0a6fb338

Nonce

3,326

Timestamp

1/22/2014, 1:20:41 PM

Confirmations

6,436,444

Merkle Root

92bb37b9c9aa41cd7d51a2ac539fdf9a9e96287e92b4c25d9c3ef74297fe029f
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.183 × 10⁹⁸(99-digit number)
11833354689003501653…79842830076220780321
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.183 × 10⁹⁸(99-digit number)
11833354689003501653…79842830076220780321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.366 × 10⁹⁸(99-digit number)
23666709378007003307…59685660152441560641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.733 × 10⁹⁸(99-digit number)
47333418756014006615…19371320304883121281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.466 × 10⁹⁸(99-digit number)
94666837512028013231…38742640609766242561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.893 × 10⁹⁹(100-digit number)
18933367502405602646…77485281219532485121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.786 × 10⁹⁹(100-digit number)
37866735004811205292…54970562439064970241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.573 × 10⁹⁹(100-digit number)
75733470009622410585…09941124878129940481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.514 × 10¹⁰⁰(101-digit number)
15146694001924482117…19882249756259880961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.029 × 10¹⁰⁰(101-digit number)
30293388003848964234…39764499512519761921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.058 × 10¹⁰⁰(101-digit number)
60586776007697928468…79528999025039523841
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,703,557 XPM·at block #6,807,441 · 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