Block #2,821,288

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/2/2018, 11:24:46 AM · Difficulty 11.7018 · 3,996,540 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
aba0dccc8cd6c361a70701e06448b73b12626c58e8356deb2d81944a7877430b

Height

#2,821,288

Difficulty

11.701818

Transactions

2

Size

1.28 KB

Version

2

Bits

0bb3aa58

Nonce

283,344,298

Timestamp

9/2/2018, 11:24:46 AM

Confirmations

3,996,540

Merkle Root

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

2.120 × 10⁹⁶(97-digit number)
21205826305532249063…18699557955501137921
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.120 × 10⁹⁶(97-digit number)
21205826305532249063…18699557955501137921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.241 × 10⁹⁶(97-digit number)
42411652611064498127…37399115911002275841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.482 × 10⁹⁶(97-digit number)
84823305222128996255…74798231822004551681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.696 × 10⁹⁷(98-digit number)
16964661044425799251…49596463644009103361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.392 × 10⁹⁷(98-digit number)
33929322088851598502…99192927288018206721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.785 × 10⁹⁷(98-digit number)
67858644177703197004…98385854576036413441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.357 × 10⁹⁸(99-digit number)
13571728835540639400…96771709152072826881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.714 × 10⁹⁸(99-digit number)
27143457671081278801…93543418304145653761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.428 × 10⁹⁸(99-digit number)
54286915342162557603…87086836608291307521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.085 × 10⁹⁹(100-digit number)
10857383068432511520…74173673216582615041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.171 × 10⁹⁹(100-digit number)
21714766136865023041…48347346433165230081
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,786,688 XPM·at block #6,817,827 · 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