Block #391,776

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/6/2014, 1:38:40 AM · Difficulty 10.4291 · 6,425,045 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
24c54a4f42232bdf35bd6036ded1feccdfeb49ef111c2675a098398330875c9c

Height

#391,776

Difficulty

10.429105

Transactions

4

Size

1.25 KB

Version

2

Bits

0a6dd9d9

Nonce

84,975

Timestamp

2/6/2014, 1:38:40 AM

Confirmations

6,425,045

Merkle Root

9e89db8d8aa9900f82bfed21e6d57942818dd6f0e0b41601f28db8eaab0d05c2
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.

1.976 × 10¹⁰⁰(101-digit number)
19767687277906741264…79645742139715402401
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
1.976 × 10¹⁰⁰(101-digit number)
19767687277906741264…79645742139715402401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.953 × 10¹⁰⁰(101-digit number)
39535374555813482529…59291484279430804801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.907 × 10¹⁰⁰(101-digit number)
79070749111626965058…18582968558861609601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.581 × 10¹⁰¹(102-digit number)
15814149822325393011…37165937117723219201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.162 × 10¹⁰¹(102-digit number)
31628299644650786023…74331874235446438401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.325 × 10¹⁰¹(102-digit number)
63256599289301572047…48663748470892876801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.265 × 10¹⁰²(103-digit number)
12651319857860314409…97327496941785753601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.530 × 10¹⁰²(103-digit number)
25302639715720628818…94654993883571507201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.060 × 10¹⁰²(103-digit number)
50605279431441257637…89309987767143014401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.012 × 10¹⁰³(104-digit number)
10121055886288251527…78619975534286028801
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,778,607 XPM·at block #6,816,820 · 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