Block #340,052

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/2/2014, 1:02:21 PM · Difficulty 10.1274 · 6,469,535 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f92949aa9f1101fb88a9ebef1afd9c6938a7e05b02c063e937972d061f7f4ea6

Height

#340,052

Difficulty

10.127392

Transactions

1

Size

1.08 KB

Version

2

Bits

0a209cc7

Nonce

144,573

Timestamp

1/2/2014, 1:02:21 PM

Confirmations

6,469,535

Merkle Root

6fc8c136e8e831d36477aac91044665178bfac0d6c74bbae42fdee648b2218f9
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.

3.790 × 10⁹⁸(99-digit number)
37905655789260039381…48510707860630028801
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
3.790 × 10⁹⁸(99-digit number)
37905655789260039381…48510707860630028801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.581 × 10⁹⁸(99-digit number)
75811311578520078763…97021415721260057601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.516 × 10⁹⁹(100-digit number)
15162262315704015752…94042831442520115201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.032 × 10⁹⁹(100-digit number)
30324524631408031505…88085662885040230401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.064 × 10⁹⁹(100-digit number)
60649049262816063010…76171325770080460801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.212 × 10¹⁰⁰(101-digit number)
12129809852563212602…52342651540160921601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.425 × 10¹⁰⁰(101-digit number)
24259619705126425204…04685303080321843201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.851 × 10¹⁰⁰(101-digit number)
48519239410252850408…09370606160643686401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.703 × 10¹⁰⁰(101-digit number)
97038478820505700816…18741212321287372801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.940 × 10¹⁰¹(102-digit number)
19407695764101140163…37482424642574745601
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,720,772 XPM·at block #6,809,586 · 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