Block #418,854

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/25/2014, 5:04:48 AM · Difficulty 10.3834 · 6,408,221 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
39954e6751181bb10979b5fc6f1d7e8dae02b75dc01bb7f42ab7b660c6424e8c

Height

#418,854

Difficulty

10.383354

Transactions

10

Size

2.48 KB

Version

2

Bits

0a622381

Nonce

151

Timestamp

2/25/2014, 5:04:48 AM

Confirmations

6,408,221

Merkle Root

6013bcd559cd030a951866a089af6381902690a56c89a7feec7991b5b1fde643
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.

9.067 × 10¹⁰⁶(107-digit number)
90671465346456396221…36662689585697914881
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
9.067 × 10¹⁰⁶(107-digit number)
90671465346456396221…36662689585697914881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.813 × 10¹⁰⁷(108-digit number)
18134293069291279244…73325379171395829761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.626 × 10¹⁰⁷(108-digit number)
36268586138582558488…46650758342791659521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.253 × 10¹⁰⁷(108-digit number)
72537172277165116977…93301516685583319041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.450 × 10¹⁰⁸(109-digit number)
14507434455433023395…86603033371166638081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.901 × 10¹⁰⁸(109-digit number)
29014868910866046790…73206066742333276161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.802 × 10¹⁰⁸(109-digit number)
58029737821732093581…46412133484666552321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.160 × 10¹⁰⁹(110-digit number)
11605947564346418716…92824266969333104641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.321 × 10¹⁰⁹(110-digit number)
23211895128692837432…85648533938666209281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.642 × 10¹⁰⁹(110-digit number)
46423790257385674865…71297067877332418561
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,860,784 XPM·at block #6,827,074 · 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