Block #345,958

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/6/2014, 6:41:55 AM · Difficulty 10.2152 · 6,480,692 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1c2e705a0db88959ceb007fc508bfabf41cfe5a8e5cd375f05aff2dfd3212f4f

Height

#345,958

Difficulty

10.215249

Transactions

6

Size

2.05 KB

Version

2

Bits

0a371a88

Nonce

5,938

Timestamp

1/6/2014, 6:41:55 AM

Confirmations

6,480,692

Merkle Root

ad30644b2d6d35a3a54fb2210d84bcc19f68c5b0371335db678b02655325a8c3
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.117 × 10¹⁰⁵(106-digit number)
11175342054887759342…73183127070535321601
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.117 × 10¹⁰⁵(106-digit number)
11175342054887759342…73183127070535321601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.235 × 10¹⁰⁵(106-digit number)
22350684109775518684…46366254141070643201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.470 × 10¹⁰⁵(106-digit number)
44701368219551037368…92732508282141286401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
8.940 × 10¹⁰⁵(106-digit number)
89402736439102074736…85465016564282572801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.788 × 10¹⁰⁶(107-digit number)
17880547287820414947…70930033128565145601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.576 × 10¹⁰⁶(107-digit number)
35761094575640829894…41860066257130291201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.152 × 10¹⁰⁶(107-digit number)
71522189151281659789…83720132514260582401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.430 × 10¹⁰⁷(108-digit number)
14304437830256331957…67440265028521164801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.860 × 10¹⁰⁷(108-digit number)
28608875660512663915…34880530057042329601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.721 × 10¹⁰⁷(108-digit number)
57217751321025327831…69761060114084659201
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,857,349 XPM·at block #6,826,649 · 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