Block #2,827,940

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/6/2018, 11:28:59 PM · Difficulty 11.7120 · 4,015,395 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
649ce571329a5c47a3e079db8a3571b0813b7eba6c50e4f26ab05b2880b5644a

Height

#2,827,940

Difficulty

11.711978

Transactions

27

Size

6.37 KB

Version

2

Bits

0bb6442e

Nonce

1,122,747,927

Timestamp

9/6/2018, 11:28:59 PM

Confirmations

4,015,395

Merkle Root

26eedc90f6256fed990ecec40fad5092183ccd1855ab4b583ab19c6846ccc102
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.531 × 10⁹⁷(98-digit number)
25311277048901602988…25601449398416773121
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.531 × 10⁹⁷(98-digit number)
25311277048901602988…25601449398416773121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.062 × 10⁹⁷(98-digit number)
50622554097803205977…51202898796833546241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.012 × 10⁹⁸(99-digit number)
10124510819560641195…02405797593667092481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.024 × 10⁹⁸(99-digit number)
20249021639121282390…04811595187334184961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.049 × 10⁹⁸(99-digit number)
40498043278242564781…09623190374668369921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.099 × 10⁹⁸(99-digit number)
80996086556485129563…19246380749336739841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.619 × 10⁹⁹(100-digit number)
16199217311297025912…38492761498673479681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.239 × 10⁹⁹(100-digit number)
32398434622594051825…76985522997346959361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.479 × 10⁹⁹(100-digit number)
64796869245188103650…53971045994693918721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.295 × 10¹⁰⁰(101-digit number)
12959373849037620730…07942091989387837441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.591 × 10¹⁰⁰(101-digit number)
25918747698075241460…15884183978775674881
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,991,042 XPM·at block #6,843,334 · 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