1. #6,815,1071CC11 primes

    Cunningham 1st · ⛏️ coinsforall.io

Block #334,290

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/29/2013, 9:48:06 AM · Difficulty 10.1579 · 6,480,818 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
11d5f158777f89a0ce2305e7207941dc190b44e1d5f47da6ae7ac7cf80a19168

Height

#334,290

Difficulty

10.157946

Transactions

1

Size

1.08 KB

Version

2

Bits

0a286f29

Nonce

14,085

Timestamp

12/29/2013, 9:48:06 AM

Confirmations

6,480,818

Merkle Root

5f5eba613c4866c6be9c76a39c2b3066220285972ea02e4c7a7fa0ae9da761d1
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.

2.288 × 10⁹⁹(100-digit number)
22888218669618998399…65121521467494379521
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
2.288 × 10⁹⁹(100-digit number)
22888218669618998399…65121521467494379521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.577 × 10⁹⁹(100-digit number)
45776437339237996798…30243042934988759041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.155 × 10⁹⁹(100-digit number)
91552874678475993596…60486085869977518081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.831 × 10¹⁰⁰(101-digit number)
18310574935695198719…20972171739955036161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.662 × 10¹⁰⁰(101-digit number)
36621149871390397438…41944343479910072321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.324 × 10¹⁰⁰(101-digit number)
73242299742780794877…83888686959820144641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.464 × 10¹⁰¹(102-digit number)
14648459948556158975…67777373919640289281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.929 × 10¹⁰¹(102-digit number)
29296919897112317951…35554747839280578561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.859 × 10¹⁰¹(102-digit number)
58593839794224635902…71109495678561157121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.171 × 10¹⁰²(103-digit number)
11718767958844927180…42218991357122314241
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,764,954 XPM·at block #6,815,107 · 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.
Privacy Policy·

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