Block #409,744

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/18/2014, 2:16:40 PM · Difficulty 10.4281 · 6,415,003 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e68df4166a5376159eab761be353eca97a93b4f10f9a891d0b190b62ec458375

Height

#409,744

Difficulty

10.428073

Transactions

2

Size

426 B

Version

2

Bits

0a6d962e

Nonce

559,214

Timestamp

2/18/2014, 2:16:40 PM

Confirmations

6,415,003

Merkle Root

9695e9ca92d3a996fe02b52995386e77c778e9ac484229187585f410aaddc996
Transactions (2)
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.

7.713 × 10¹⁰¹(102-digit number)
77138015210145831585…52174233329574700801
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
7.713 × 10¹⁰¹(102-digit number)
77138015210145831585…52174233329574700801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.542 × 10¹⁰²(103-digit number)
15427603042029166317…04348466659149401601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.085 × 10¹⁰²(103-digit number)
30855206084058332634…08696933318298803201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.171 × 10¹⁰²(103-digit number)
61710412168116665268…17393866636597606401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.234 × 10¹⁰³(104-digit number)
12342082433623333053…34787733273195212801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.468 × 10¹⁰³(104-digit number)
24684164867246666107…69575466546390425601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.936 × 10¹⁰³(104-digit number)
49368329734493332214…39150933092780851201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.873 × 10¹⁰³(104-digit number)
98736659468986664429…78301866185561702401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.974 × 10¹⁰⁴(105-digit number)
19747331893797332885…56603732371123404801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.949 × 10¹⁰⁴(105-digit number)
39494663787594665771…13207464742246809601
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,842,047 XPM·at block #6,824,746 · 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