Block #342,106

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/3/2014, 9:00:43 PM · Difficulty 10.1503 · 6,467,586 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0ba6c9a98da0821dc828e5c8e9fed921d3fcbb4611d9a548f2250935c1b685ef

Height

#342,106

Difficulty

10.150278

Transactions

11

Size

2.69 KB

Version

2

Bits

0a26789d

Nonce

9,540

Timestamp

1/3/2014, 9:00:43 PM

Confirmations

6,467,586

Merkle Root

052e566c48e0814d8893e20a293ee592f08e331692ade63d848f4a8131d564d9
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.662 × 10¹⁰⁵(106-digit number)
16621633936183807232…33794882099834900001
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.662 × 10¹⁰⁵(106-digit number)
16621633936183807232…33794882099834900001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.324 × 10¹⁰⁵(106-digit number)
33243267872367614464…67589764199669800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
6.648 × 10¹⁰⁵(106-digit number)
66486535744735228929…35179528399339600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.329 × 10¹⁰⁶(107-digit number)
13297307148947045785…70359056798679200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.659 × 10¹⁰⁶(107-digit number)
26594614297894091571…40718113597358400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.318 × 10¹⁰⁶(107-digit number)
53189228595788183143…81436227194716800001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.063 × 10¹⁰⁷(108-digit number)
10637845719157636628…62872454389433600001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.127 × 10¹⁰⁷(108-digit number)
21275691438315273257…25744908778867200001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.255 × 10¹⁰⁷(108-digit number)
42551382876630546515…51489817557734400001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
8.510 × 10¹⁰⁷(108-digit number)
85102765753261093030…02979635115468800001
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,721,612 XPM·at block #6,809,691 · 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