Block #350,258

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/8/2014, 10:28:28 PM · Difficulty 10.2867 · 6,456,319 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
41e989cad421948b47f44b46adc874a70e2c6bfa6715e09f5bf7169c50e16c98

Height

#350,258

Difficulty

10.286668

Transactions

13

Size

3.57 KB

Version

2

Bits

0a496315

Nonce

489,580

Timestamp

1/8/2014, 10:28:28 PM

Confirmations

6,456,319

Merkle Root

8fe7dac01708df325b239fa27d252c1f57e0d9c17432b42a5856426e0cb68f7c
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.493 × 10⁹⁸(99-digit number)
54937052606189604003…62503207264666024001
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.493 × 10⁹⁸(99-digit number)
54937052606189604003…62503207264666024001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.098 × 10⁹⁹(100-digit number)
10987410521237920800…25006414529332048001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.197 × 10⁹⁹(100-digit number)
21974821042475841601…50012829058664096001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.394 × 10⁹⁹(100-digit number)
43949642084951683203…00025658117328192001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.789 × 10⁹⁹(100-digit number)
87899284169903366406…00051316234656384001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.757 × 10¹⁰⁰(101-digit number)
17579856833980673281…00102632469312768001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.515 × 10¹⁰⁰(101-digit number)
35159713667961346562…00205264938625536001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.031 × 10¹⁰⁰(101-digit number)
70319427335922693124…00410529877251072001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.406 × 10¹⁰¹(102-digit number)
14063885467184538624…00821059754502144001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.812 × 10¹⁰¹(102-digit number)
28127770934369077249…01642119509004288001
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,696,711 XPM·at block #6,806,576 · 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