Block #384,185

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/31/2014, 10:24:22 PM · Difficulty 10.4037 · 6,426,414 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fb8c73259cff252b8135df9301d4ca83cf3026c73961ee12ce07315bf58b4348

Height

#384,185

Difficulty

10.403673

Transactions

3

Size

1000 B

Version

2

Bits

0a67571e

Nonce

261

Timestamp

1/31/2014, 10:24:22 PM

Confirmations

6,426,414

Merkle Root

8220847d4112824cab7951b4f9f2eda7b2273696009f810c394bb9a3c03c4855
Transactions (3)
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.

6.363 × 10⁹²(93-digit number)
63633159928490872530…28863954141772610111
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
6.363 × 10⁹²(93-digit number)
63633159928490872530…28863954141772610111
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.272 × 10⁹³(94-digit number)
12726631985698174506…57727908283545220221
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.545 × 10⁹³(94-digit number)
25453263971396349012…15455816567090440441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.090 × 10⁹³(94-digit number)
50906527942792698024…30911633134180880881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.018 × 10⁹⁴(95-digit number)
10181305588558539604…61823266268361761761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.036 × 10⁹⁴(95-digit number)
20362611177117079209…23646532536723523521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.072 × 10⁹⁴(95-digit number)
40725222354234158419…47293065073447047041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.145 × 10⁹⁴(95-digit number)
81450444708468316838…94586130146894094081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.629 × 10⁹⁵(96-digit number)
16290088941693663367…89172260293788188161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.258 × 10⁹⁵(96-digit number)
32580177883387326735…78344520587576376321
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,728,880 XPM·at block #6,810,598 · 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