Block #351,061

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 1/9/2014, 11:10:10 AM · Difficulty 10.2916 · 6,473,976 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
c6020e920d34b850d4d2b4516eb99b7040ad33c98663885dfba177ff6ba02cf6

Height

#351,061

Difficulty

10.291593

Transactions

16

Size

4.49 KB

Version

2

Bits

0a4aa5de

Nonce

12,439

Timestamp

1/9/2014, 11:10:10 AM

Confirmations

6,473,976

Merkle Root

3b0b04f00723d2cc42c735a000b6ea767ebb97588f75c09710d4b25878582415
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.

1.765 × 10⁹⁸(99-digit number)
17658522217337592024…14394669023486936321
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
1.765 × 10⁹⁸(99-digit number)
17658522217337592024…14394669023486936321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.531 × 10⁹⁸(99-digit number)
35317044434675184049…28789338046973872641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.063 × 10⁹⁸(99-digit number)
70634088869350368098…57578676093947745281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.412 × 10⁹⁹(100-digit number)
14126817773870073619…15157352187895490561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.825 × 10⁹⁹(100-digit number)
28253635547740147239…30314704375790981121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.650 × 10⁹⁹(100-digit number)
56507271095480294478…60629408751581962241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.130 × 10¹⁰⁰(101-digit number)
11301454219096058895…21258817503163924481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.260 × 10¹⁰⁰(101-digit number)
22602908438192117791…42517635006327848961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.520 × 10¹⁰⁰(101-digit number)
45205816876384235583…85035270012655697921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.041 × 10¹⁰⁰(101-digit number)
90411633752768471166…70070540025311395841
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,844,380 XPM·at block #6,825,036 · 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