Block #409,319

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/18/2014, 7:42:14 AM · Difficulty 10.4242 · 6,401,099 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8e29686411ff24823dcf5b24dccff3e8918f97d81953a68ea9ae3af9b0db6f7b

Height

#409,319

Difficulty

10.424194

Transactions

7

Size

2.11 KB

Version

2

Bits

0a6c97fe

Nonce

711

Timestamp

2/18/2014, 7:42:14 AM

Confirmations

6,401,099

Merkle Root

e4c9e4ac4effb9e0045f2ee3cc75614ef754f3510ddf1507cd3513544a97e8e5
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.602 × 10¹⁰⁴(105-digit number)
46024872987656183448…20785895111807467521
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.602 × 10¹⁰⁴(105-digit number)
46024872987656183448…20785895111807467521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.204 × 10¹⁰⁴(105-digit number)
92049745975312366896…41571790223614935041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.840 × 10¹⁰⁵(106-digit number)
18409949195062473379…83143580447229870081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.681 × 10¹⁰⁵(106-digit number)
36819898390124946758…66287160894459740161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.363 × 10¹⁰⁵(106-digit number)
73639796780249893516…32574321788919480321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.472 × 10¹⁰⁶(107-digit number)
14727959356049978703…65148643577838960641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.945 × 10¹⁰⁶(107-digit number)
29455918712099957406…30297287155677921281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.891 × 10¹⁰⁶(107-digit number)
58911837424199914813…60594574311355842561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.178 × 10¹⁰⁷(108-digit number)
11782367484839982962…21189148622711685121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.356 × 10¹⁰⁷(108-digit number)
23564734969679965925…42378297245423370241
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,727,425 XPM·at block #6,810,417 · 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