Block #350,121

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/8/2014, 7:52:18 PM · Difficulty 10.2892 · 6,467,248 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9cd21f64ec6f8b7e288879dd7a1c34341f0e9414a16287133a066bc3e4c8678c

Height

#350,121

Difficulty

10.289195

Transactions

4

Size

1.82 KB

Version

2

Bits

0a4a08b6

Nonce

5,548

Timestamp

1/8/2014, 7:52:18 PM

Confirmations

6,467,248

Merkle Root

3641daec4155a6d0566a11d192b18fdd5427f0a0e7950365a9810dc03659fe7b
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.

2.997 × 10⁹⁹(100-digit number)
29975091525180379058…34696829674230463841
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
2.997 × 10⁹⁹(100-digit number)
29975091525180379058…34696829674230463841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.995 × 10⁹⁹(100-digit number)
59950183050360758117…69393659348460927681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.199 × 10¹⁰⁰(101-digit number)
11990036610072151623…38787318696921855361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.398 × 10¹⁰⁰(101-digit number)
23980073220144303247…77574637393843710721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.796 × 10¹⁰⁰(101-digit number)
47960146440288606494…55149274787687421441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.592 × 10¹⁰⁰(101-digit number)
95920292880577212988…10298549575374842881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.918 × 10¹⁰¹(102-digit number)
19184058576115442597…20597099150749685761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.836 × 10¹⁰¹(102-digit number)
38368117152230885195…41194198301499371521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.673 × 10¹⁰¹(102-digit number)
76736234304461770390…82388396602998743041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.534 × 10¹⁰²(103-digit number)
15347246860892354078…64776793205997486081
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,782,992 XPM·at block #6,817,368 · 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