Block #391,602

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/5/2014, 10:18:20 PM · Difficulty 10.4324 · 6,416,434 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
451180d173afdff3b6f4a039e5dd63964c7906116c36a0d449cf63c722342658

Height

#391,602

Difficulty

10.432361

Transactions

7

Size

4.40 KB

Version

2

Bits

0a6eaf36

Nonce

243,262

Timestamp

2/5/2014, 10:18:20 PM

Confirmations

6,416,434

Merkle Root

399aabccb41952bf03f15af5854ea8ee9d954210b5fd148f614836379eb75100
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.697 × 10⁹⁸(99-digit number)
46973854381414451125…95562591196888773781
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.697 × 10⁹⁸(99-digit number)
46973854381414451125…95562591196888773781
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.394 × 10⁹⁸(99-digit number)
93947708762828902250…91125182393777547561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.878 × 10⁹⁹(100-digit number)
18789541752565780450…82250364787555095121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.757 × 10⁹⁹(100-digit number)
37579083505131560900…64500729575110190241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.515 × 10⁹⁹(100-digit number)
75158167010263121800…29001459150220380481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.503 × 10¹⁰⁰(101-digit number)
15031633402052624360…58002918300440760961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.006 × 10¹⁰⁰(101-digit number)
30063266804105248720…16005836600881521921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.012 × 10¹⁰⁰(101-digit number)
60126533608210497440…32011673201763043841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.202 × 10¹⁰¹(102-digit number)
12025306721642099488…64023346403526087681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.405 × 10¹⁰¹(102-digit number)
24050613443284198976…28046692807052175361
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,708,333 XPM·at block #6,808,035 · 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