Block #391,060

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/5/2014, 1:53:55 PM · Difficulty 10.4275 · 6,434,132 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6e488b69c707cde7091fd60a69230d1a28132f219860af45ce197256eb9bb1fc

Height

#391,060

Difficulty

10.427545

Transactions

5

Size

1.09 KB

Version

2

Bits

0a6d738f

Nonce

330,523

Timestamp

2/5/2014, 1:53:55 PM

Confirmations

6,434,132

Merkle Root

77921f7c80779d2b1d33dc54cd824bc120e0d8531bd477bd76d4ff0d3a0a83ec
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.

5.857 × 10⁹⁹(100-digit number)
58572972758883547835…19988311660405657601
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
5.857 × 10⁹⁹(100-digit number)
58572972758883547835…19988311660405657601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.171 × 10¹⁰⁰(101-digit number)
11714594551776709567…39976623320811315201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.342 × 10¹⁰⁰(101-digit number)
23429189103553419134…79953246641622630401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.685 × 10¹⁰⁰(101-digit number)
46858378207106838268…59906493283245260801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.371 × 10¹⁰⁰(101-digit number)
93716756414213676536…19812986566490521601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.874 × 10¹⁰¹(102-digit number)
18743351282842735307…39625973132981043201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.748 × 10¹⁰¹(102-digit number)
37486702565685470614…79251946265962086401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.497 × 10¹⁰¹(102-digit number)
74973405131370941229…58503892531924172801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.499 × 10¹⁰²(103-digit number)
14994681026274188245…17007785063848345601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.998 × 10¹⁰²(103-digit number)
29989362052548376491…34015570127696691201
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,845,627 XPM·at block #6,825,191 · 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.
Privacy Policy·

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