Block #242,310

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 11/3/2013, 4:31:18 PM · Difficulty 9.9596 · 6,567,250 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a930d0bf164007eb634342e08008faa95f0421b08e117bd5e89f09bb2fa5014c

Height

#242,310

Difficulty

9.959572

Transactions

2

Size

422 B

Version

2

Bits

09f5a67c

Nonce

6,877

Timestamp

11/3/2013, 4:31:18 PM

Confirmations

6,567,250

Merkle Root

fe814a622db8c1c3807b388000cb407d0e7168f579a0b4162417e0295d4c9198
Transactions (2)
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.

4.190 × 10⁹⁸(99-digit number)
41907624925188884554…46093749773065705921
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
4.190 × 10⁹⁸(99-digit number)
41907624925188884554…46093749773065705921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.381 × 10⁹⁸(99-digit number)
83815249850377769109…92187499546131411841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.676 × 10⁹⁹(100-digit number)
16763049970075553821…84374999092262823681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.352 × 10⁹⁹(100-digit number)
33526099940151107643…68749998184525647361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.705 × 10⁹⁹(100-digit number)
67052199880302215287…37499996369051294721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.341 × 10¹⁰⁰(101-digit number)
13410439976060443057…74999992738102589441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.682 × 10¹⁰⁰(101-digit number)
26820879952120886114…49999985476205178881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.364 × 10¹⁰⁰(101-digit number)
53641759904241772229…99999970952410357761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.072 × 10¹⁰¹(102-digit number)
10728351980848354445…99999941904820715521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.145 × 10¹⁰¹(102-digit number)
21456703961696708891…99999883809641431041
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,720,554 XPM·at block #6,809,559 · 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