Block #338,831

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/1/2014, 4:57:40 PM · Difficulty 10.1240 · 6,469,344 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
dcc4818c0a2fafffe90e149737ef9bb0f501d12fa97b99d066c88665210cf27c

Height

#338,831

Difficulty

10.124016

Transactions

1

Size

1.02 KB

Version

2

Bits

0a1fbf7d

Nonce

17,503

Timestamp

1/1/2014, 4:57:40 PM

Confirmations

6,469,344

Merkle Root

e62f77ade618bdd5842d5e10e05155e7b7e685f79c69cb12c2b9624b84f42be7
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.106 × 10¹⁰²(103-digit number)
11068801382083026818…02287541021462405121
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.106 × 10¹⁰²(103-digit number)
11068801382083026818…02287541021462405121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.213 × 10¹⁰²(103-digit number)
22137602764166053637…04575082042924810241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.427 × 10¹⁰²(103-digit number)
44275205528332107274…09150164085849620481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.855 × 10¹⁰²(103-digit number)
88550411056664214549…18300328171699240961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.771 × 10¹⁰³(104-digit number)
17710082211332842909…36600656343398481921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.542 × 10¹⁰³(104-digit number)
35420164422665685819…73201312686796963841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.084 × 10¹⁰³(104-digit number)
70840328845331371639…46402625373593927681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.416 × 10¹⁰⁴(105-digit number)
14168065769066274327…92805250747187855361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.833 × 10¹⁰⁴(105-digit number)
28336131538132548655…85610501494375710721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.667 × 10¹⁰⁴(105-digit number)
56672263076265097311…71221002988751421441
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,709,448 XPM·at block #6,808,174 · 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