Block #343,988

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/5/2014, 12:42:19 AM · Difficulty 10.1878 · 6,464,266 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fcbb6b500e2c718eb6921b3ce41dd8fba2f73f470394a73abe1fb9cc7eff5d3f

Height

#343,988

Difficulty

10.187771

Transactions

6

Size

1.88 KB

Version

2

Bits

0a3011bf

Nonce

240,412

Timestamp

1/5/2014, 12:42:19 AM

Confirmations

6,464,266

Merkle Root

9875c940a22db2c3644c120dd412b54c005c9260869347619c688f452767da0b
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.211 × 10⁹⁸(99-digit number)
12118786839262413365…18517713661980612801
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.211 × 10⁹⁸(99-digit number)
12118786839262413365…18517713661980612801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.423 × 10⁹⁸(99-digit number)
24237573678524826730…37035427323961225601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.847 × 10⁹⁸(99-digit number)
48475147357049653461…74070854647922451201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.695 × 10⁹⁸(99-digit number)
96950294714099306923…48141709295844902401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.939 × 10⁹⁹(100-digit number)
19390058942819861384…96283418591689804801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.878 × 10⁹⁹(100-digit number)
38780117885639722769…92566837183379609601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.756 × 10⁹⁹(100-digit number)
77560235771279445538…85133674366759219201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.551 × 10¹⁰⁰(101-digit number)
15512047154255889107…70267348733518438401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.102 × 10¹⁰⁰(101-digit number)
31024094308511778215…40534697467036876801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.204 × 10¹⁰⁰(101-digit number)
62048188617023556431…81069394934073753601
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,710,078 XPM·at block #6,808,253 · 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