Block #350,215

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/8/2014, 9:28:42 PM · Difficulty 10.2887 · 6,458,685 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
5fbd52fe6901f5c927d1f0916e302290fe5429b16678ef8cd6f12cc7cb842361

Height

#350,215

Difficulty

10.288733

Transactions

16

Size

4.47 KB

Version

2

Bits

0a49ea6b

Nonce

3,578

Timestamp

1/8/2014, 9:28:42 PM

Confirmations

6,458,685

Merkle Root

116c62944fbfb6f341f7397d851274ad9772da58105a0bb8aa242bbf860f7f24
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.

5.780 × 10⁹⁹(100-digit number)
57801600594899181240…07282904349958876161
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
5.780 × 10⁹⁹(100-digit number)
57801600594899181240…07282904349958876161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.156 × 10¹⁰⁰(101-digit number)
11560320118979836248…14565808699917752321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.312 × 10¹⁰⁰(101-digit number)
23120640237959672496…29131617399835504641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.624 × 10¹⁰⁰(101-digit number)
46241280475919344992…58263234799671009281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.248 × 10¹⁰⁰(101-digit number)
92482560951838689984…16526469599342018561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.849 × 10¹⁰¹(102-digit number)
18496512190367737996…33052939198684037121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.699 × 10¹⁰¹(102-digit number)
36993024380735475993…66105878397368074241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.398 × 10¹⁰¹(102-digit number)
73986048761470951987…32211756794736148481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.479 × 10¹⁰²(103-digit number)
14797209752294190397…64423513589472296961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.959 × 10¹⁰²(103-digit number)
29594419504588380795…28847027178944593921
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,715,253 XPM·at block #6,808,899 · 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