Block #375,831

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/26/2014, 12:01:24 AM · Difficulty 10.4233 · 6,432,643 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
70d3ed440082e18213059522fcd9fa53e865758175d9046abd824851a46b4872

Height

#375,831

Difficulty

10.423342

Transactions

10

Size

2.73 KB

Version

2

Bits

0a6c602b

Nonce

242,361

Timestamp

1/26/2014, 12:01:24 AM

Confirmations

6,432,643

Merkle Root

86b7d1720d26251c4ffaeeae029175d082902627302d2688fae8fcbea75cd191
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.258 × 10⁹⁷(98-digit number)
32585697944946150186…38155342105449553921
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.258 × 10⁹⁷(98-digit number)
32585697944946150186…38155342105449553921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.517 × 10⁹⁷(98-digit number)
65171395889892300372…76310684210899107841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.303 × 10⁹⁸(99-digit number)
13034279177978460074…52621368421798215681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.606 × 10⁹⁸(99-digit number)
26068558355956920148…05242736843596431361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.213 × 10⁹⁸(99-digit number)
52137116711913840297…10485473687192862721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.042 × 10⁹⁹(100-digit number)
10427423342382768059…20970947374385725441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.085 × 10⁹⁹(100-digit number)
20854846684765536119…41941894748771450881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.170 × 10⁹⁹(100-digit number)
41709693369531072238…83883789497542901761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.341 × 10⁹⁹(100-digit number)
83419386739062144476…67767578995085803521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.668 × 10¹⁰⁰(101-digit number)
16683877347812428895…35535157990171607041
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,711,841 XPM·at block #6,808,473 · 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