Block #350,864

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/9/2014, 8:28:21 AM · Difficulty 10.2877 · 6,458,069 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
b9b592107c2dd8efe116fa7cd45a6092c5655166b703ed1b9b783837580c4ceb

Height

#350,864

Difficulty

10.287748

Transactions

15

Size

4.81 KB

Version

2

Bits

0a49a9de

Nonce

42,146

Timestamp

1/9/2014, 8:28:21 AM

Confirmations

6,458,069

Merkle Root

58135598506c74d63372c67fdb36902ebdebef0e61e863d57841f7d32f688352
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.204 × 10¹⁰¹(102-digit number)
52043245579407386411…54642397811878007771
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.204 × 10¹⁰¹(102-digit number)
52043245579407386411…54642397811878007771
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.040 × 10¹⁰²(103-digit number)
10408649115881477282…09284795623756015541
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.081 × 10¹⁰²(103-digit number)
20817298231762954564…18569591247512031081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.163 × 10¹⁰²(103-digit number)
41634596463525909128…37139182495024062161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.326 × 10¹⁰²(103-digit number)
83269192927051818257…74278364990048124321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.665 × 10¹⁰³(104-digit number)
16653838585410363651…48556729980096248641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.330 × 10¹⁰³(104-digit number)
33307677170820727303…97113459960192497281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.661 × 10¹⁰³(104-digit number)
66615354341641454606…94226919920384994561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.332 × 10¹⁰⁴(105-digit number)
13323070868328290921…88453839840769989121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.664 × 10¹⁰⁴(105-digit number)
26646141736656581842…76907679681539978241
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,520 XPM·at block #6,808,932 · 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