Block #2,831,650

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/9/2018, 11:38:47 AM · Difficulty 11.7176 · 4,004,693 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4129a1f9e6c4564b003ca0869ec4e087dfb991f288eed871f3257ebf3fce724d

Height

#2,831,650

Difficulty

11.717591

Transactions

2

Size

1.72 KB

Version

2

Bits

0bb7b406

Nonce

1,400,090,747

Timestamp

9/9/2018, 11:38:47 AM

Confirmations

4,004,693

Merkle Root

145b8d8e9cbecc76744bc0e741e9a69c8eaf2ae5ce911bceb7c3293403ad30c8
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.

5.822 × 10⁹⁵(96-digit number)
58228432915786168947…48022451638862929921
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
5.822 × 10⁹⁵(96-digit number)
58228432915786168947…48022451638862929921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.164 × 10⁹⁶(97-digit number)
11645686583157233789…96044903277725859841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.329 × 10⁹⁶(97-digit number)
23291373166314467579…92089806555451719681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.658 × 10⁹⁶(97-digit number)
46582746332628935158…84179613110903439361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.316 × 10⁹⁶(97-digit number)
93165492665257870316…68359226221806878721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.863 × 10⁹⁷(98-digit number)
18633098533051574063…36718452443613757441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.726 × 10⁹⁷(98-digit number)
37266197066103148126…73436904887227514881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.453 × 10⁹⁷(98-digit number)
74532394132206296253…46873809774455029761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.490 × 10⁹⁸(99-digit number)
14906478826441259250…93747619548910059521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.981 × 10⁹⁸(99-digit number)
29812957652882518501…87495239097820119041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.962 × 10⁹⁸(99-digit number)
59625915305765037002…74990478195640238081
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 11 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
RareChain length 11

Approximately 1 in 1,000 blocks. Noteworthy discoveries.

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,935,002 XPM·at block #6,836,342 · 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