Block #391,112

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/5/2014, 2:41:56 PM · Difficulty 10.4282 · 6,417,970 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5428d2566fcf2a31bed3ee16d8569dfac0c62e0691bd06b8d7714637c5ee4154

Height

#391,112

Difficulty

10.428203

Transactions

10

Size

5.04 KB

Version

2

Bits

0a6d9eae

Nonce

167,776,390

Timestamp

2/5/2014, 2:41:56 PM

Confirmations

6,417,970

Merkle Root

1a4a850a4756a0108b05a910c014ab9c9169b849c536faa8a59f17fb0ece1414
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.

4.601 × 10⁹⁵(96-digit number)
46016985158595311658…16030173257396433441
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
4.601 × 10⁹⁵(96-digit number)
46016985158595311658…16030173257396433441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.203 × 10⁹⁵(96-digit number)
92033970317190623316…32060346514792866881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.840 × 10⁹⁶(97-digit number)
18406794063438124663…64120693029585733761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.681 × 10⁹⁶(97-digit number)
36813588126876249326…28241386059171467521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.362 × 10⁹⁶(97-digit number)
73627176253752498653…56482772118342935041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.472 × 10⁹⁷(98-digit number)
14725435250750499730…12965544236685870081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.945 × 10⁹⁷(98-digit number)
29450870501500999461…25931088473371740161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.890 × 10⁹⁷(98-digit number)
58901741003001998922…51862176946743480321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.178 × 10⁹⁸(99-digit number)
11780348200600399784…03724353893486960641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.356 × 10⁹⁸(99-digit number)
23560696401200799569…07448707786973921281
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,716,718 XPM·at block #6,809,081 · 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