Block #343,433

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/4/2014, 4:25:18 PM · Difficulty 10.1781 · 6,466,522 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fe0ffd16f3ac9e62dc3e0af9120aa66a270711c9b87a5de9ebac2d03dc4f3cbf

Height

#343,433

Difficulty

10.178133

Transactions

3

Size

2.05 KB

Version

2

Bits

0a2d9a22

Nonce

21,777

Timestamp

1/4/2014, 4:25:18 PM

Confirmations

6,466,522

Merkle Root

af350a2102f7fcac53dfb20705f3d1f76f8f78cf43b6d5441398685c217678ad
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.905 × 10¹⁰¹(102-digit number)
39055210603869711766…49548782264754644481
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.905 × 10¹⁰¹(102-digit number)
39055210603869711766…49548782264754644481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.811 × 10¹⁰¹(102-digit number)
78110421207739423533…99097564529509288961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.562 × 10¹⁰²(103-digit number)
15622084241547884706…98195129059018577921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.124 × 10¹⁰²(103-digit number)
31244168483095769413…96390258118037155841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.248 × 10¹⁰²(103-digit number)
62488336966191538827…92780516236074311681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.249 × 10¹⁰³(104-digit number)
12497667393238307765…85561032472148623361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.499 × 10¹⁰³(104-digit number)
24995334786476615530…71122064944297246721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.999 × 10¹⁰³(104-digit number)
49990669572953231061…42244129888594493441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.998 × 10¹⁰³(104-digit number)
99981339145906462123…84488259777188986881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.999 × 10¹⁰⁴(105-digit number)
19996267829181292424…68976519554377973761
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,723,721 XPM·at block #6,809,954 · 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