Block #406,728

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/16/2014, 11:05:36 AM · Difficulty 10.4330 · 6,410,027 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9e77e6c9d834eae82d7e1247238056b0e1eef1ae0fccb234d8f80b84b3ec69b5

Height

#406,728

Difficulty

10.433020

Transactions

2

Size

1.09 KB

Version

2

Bits

0a6eda61

Nonce

14,668

Timestamp

2/16/2014, 11:05:36 AM

Confirmations

6,410,027

Merkle Root

040a5f38da5c04499e292e653196ad2454ff356b4c128bb11a2688ce0ae032c2
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.951 × 10¹⁰³(104-digit number)
59518631617296973109…07746360295047277121
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.951 × 10¹⁰³(104-digit number)
59518631617296973109…07746360295047277121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.190 × 10¹⁰⁴(105-digit number)
11903726323459394621…15492720590094554241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.380 × 10¹⁰⁴(105-digit number)
23807452646918789243…30985441180189108481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.761 × 10¹⁰⁴(105-digit number)
47614905293837578487…61970882360378216961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.522 × 10¹⁰⁴(105-digit number)
95229810587675156975…23941764720756433921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.904 × 10¹⁰⁵(106-digit number)
19045962117535031395…47883529441512867841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.809 × 10¹⁰⁵(106-digit number)
38091924235070062790…95767058883025735681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.618 × 10¹⁰⁵(106-digit number)
76183848470140125580…91534117766051471361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.523 × 10¹⁰⁶(107-digit number)
15236769694028025116…83068235532102942721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.047 × 10¹⁰⁶(107-digit number)
30473539388056050232…66136471064205885441
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,071 XPM·at block #6,816,754 · 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