Block #332,301

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/27/2013, 10:50:16 PM · Difficulty 10.1753 · 6,478,823 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e8d2bfb09fb7dd58e97edf2e618650624025379452885d9f69391760305a9d38

Height

#332,301

Difficulty

10.175333

Transactions

11

Size

17.25 KB

Version

2

Bits

0a2ce2a7

Nonce

347,217

Timestamp

12/27/2013, 10:50:16 PM

Confirmations

6,478,823

Merkle Root

ccbcfb2010a8d30c22efba30a03c250880902f7778b33be4c168f14e316617ea
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.

9.911 × 10⁹⁷(98-digit number)
99117919177810517979…29613738334978624641
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
9.911 × 10⁹⁷(98-digit number)
99117919177810517979…29613738334978624641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.982 × 10⁹⁸(99-digit number)
19823583835562103595…59227476669957249281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.964 × 10⁹⁸(99-digit number)
39647167671124207191…18454953339914498561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.929 × 10⁹⁸(99-digit number)
79294335342248414383…36909906679828997121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.585 × 10⁹⁹(100-digit number)
15858867068449682876…73819813359657994241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.171 × 10⁹⁹(100-digit number)
31717734136899365753…47639626719315988481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.343 × 10⁹⁹(100-digit number)
63435468273798731506…95279253438631976961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.268 × 10¹⁰⁰(101-digit number)
12687093654759746301…90558506877263953921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.537 × 10¹⁰⁰(101-digit number)
25374187309519492602…81117013754527907841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.074 × 10¹⁰⁰(101-digit number)
50748374619038985205…62234027509055815681
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,733,098 XPM·at block #6,811,123 · 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