Block #398,492

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/10/2014, 6:20:33 PM · Difficulty 10.4262 · 6,409,214 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8a52d5d18595fe0ebee10e7f7a477600053ebc45de79d2a01a771ad5ed02341a

Height

#398,492

Difficulty

10.426237

Transactions

7

Size

5.09 KB

Version

2

Bits

0a6d1de4

Nonce

131,002

Timestamp

2/10/2014, 6:20:33 PM

Confirmations

6,409,214

Merkle Root

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

3.430 × 10⁹²(93-digit number)
34307106302673117921…43058779646941580161
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
3.430 × 10⁹²(93-digit number)
34307106302673117921…43058779646941580161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.861 × 10⁹²(93-digit number)
68614212605346235843…86117559293883160321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.372 × 10⁹³(94-digit number)
13722842521069247168…72235118587766320641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.744 × 10⁹³(94-digit number)
27445685042138494337…44470237175532641281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.489 × 10⁹³(94-digit number)
54891370084276988675…88940474351065282561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.097 × 10⁹⁴(95-digit number)
10978274016855397735…77880948702130565121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.195 × 10⁹⁴(95-digit number)
21956548033710795470…55761897404261130241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.391 × 10⁹⁴(95-digit number)
43913096067421590940…11523794808522260481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.782 × 10⁹⁴(95-digit number)
87826192134843181880…23047589617044520961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.756 × 10⁹⁵(96-digit number)
17565238426968636376…46095179234089041921
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,705,679 XPM·at block #6,807,705 · 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