Block #390,812

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/5/2014, 10:06:01 AM · Difficulty 10.4254 · 6,419,391 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c05b7b2485fcdeedcb57c16f362e6ab22e07c13a97ce94bdca764e094646f343

Height

#390,812

Difficulty

10.425389

Transactions

8

Size

2.29 KB

Version

2

Bits

0a6ce64e

Nonce

61,028

Timestamp

2/5/2014, 10:06:01 AM

Confirmations

6,419,391

Merkle Root

8d775cd327f7990dfd29349971cbedc82cdb3ab3a42aad3cad0d1a0359bf4458
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.821 × 10⁹⁸(99-digit number)
28214863336958587947…15977239036303100121
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.821 × 10⁹⁸(99-digit number)
28214863336958587947…15977239036303100121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.642 × 10⁹⁸(99-digit number)
56429726673917175895…31954478072606200241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.128 × 10⁹⁹(100-digit number)
11285945334783435179…63908956145212400481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.257 × 10⁹⁹(100-digit number)
22571890669566870358…27817912290424800961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.514 × 10⁹⁹(100-digit number)
45143781339133740716…55635824580849601921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.028 × 10⁹⁹(100-digit number)
90287562678267481433…11271649161699203841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.805 × 10¹⁰⁰(101-digit number)
18057512535653496286…22543298323398407681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.611 × 10¹⁰⁰(101-digit number)
36115025071306992573…45086596646796815361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.223 × 10¹⁰⁰(101-digit number)
72230050142613985146…90173193293593630721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.444 × 10¹⁰¹(102-digit number)
14446010028522797029…80346386587187261441
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,725,696 XPM·at block #6,810,202 · 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