Block #2,633,926

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/28/2018, 4:27:38 PM · Difficulty 11.2149 · 4,198,756 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
716e46f3de44c39ea91999c11085c1dde77db2c65bd8e4b28642e5b60038c236

Height

#2,633,926

Difficulty

11.214936

Transactions

6

Size

2.30 KB

Version

2

Bits

0b370605

Nonce

374,415,276

Timestamp

4/28/2018, 4:27:38 PM

Confirmations

4,198,756

Merkle Root

d6cac485995d68d40c85eef5935f40c6553acffd4065fa968f37287e0ed98b3f
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.060 × 10⁹⁴(95-digit number)
50601295134180032865…17927944914745272321
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.060 × 10⁹⁴(95-digit number)
50601295134180032865…17927944914745272321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.012 × 10⁹⁵(96-digit number)
10120259026836006573…35855889829490544641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.024 × 10⁹⁵(96-digit number)
20240518053672013146…71711779658981089281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.048 × 10⁹⁵(96-digit number)
40481036107344026292…43423559317962178561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.096 × 10⁹⁵(96-digit number)
80962072214688052585…86847118635924357121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.619 × 10⁹⁶(97-digit number)
16192414442937610517…73694237271848714241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.238 × 10⁹⁶(97-digit number)
32384828885875221034…47388474543697428481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.476 × 10⁹⁶(97-digit number)
64769657771750442068…94776949087394856961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.295 × 10⁹⁷(98-digit number)
12953931554350088413…89553898174789713921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.590 × 10⁹⁷(98-digit number)
25907863108700176827…79107796349579427841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.181 × 10⁹⁷(98-digit number)
51815726217400353654…58215592699158855681
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,905,610 XPM·at block #6,832,681 · 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