Block #2,641,812

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2018, 12:06:28 PM · Difficulty 11.6326 · 4,191,556 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
119fd1c5b078fc6fcdbe55e18c8bc0271f9f3e386a27c28cb8f0a3db03e82d26

Height

#2,641,812

Difficulty

11.632631

Transactions

8

Size

1.89 KB

Version

2

Bits

0ba1f418

Nonce

96,125,034

Timestamp

5/1/2018, 12:06:28 PM

Confirmations

4,191,556

Merkle Root

41973cef4f2fff62424c3f5915676fc5b1a0c4e510639fd79922d05b89c8b70f
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.

8.423 × 10⁹⁵(96-digit number)
84237974637465569226…77883516303241589761
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
8.423 × 10⁹⁵(96-digit number)
84237974637465569226…77883516303241589761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.684 × 10⁹⁶(97-digit number)
16847594927493113845…55767032606483179521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.369 × 10⁹⁶(97-digit number)
33695189854986227690…11534065212966359041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.739 × 10⁹⁶(97-digit number)
67390379709972455381…23068130425932718081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.347 × 10⁹⁷(98-digit number)
13478075941994491076…46136260851865436161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.695 × 10⁹⁷(98-digit number)
26956151883988982152…92272521703730872321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.391 × 10⁹⁷(98-digit number)
53912303767977964305…84545043407461744641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.078 × 10⁹⁸(99-digit number)
10782460753595592861…69090086814923489281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.156 × 10⁹⁸(99-digit number)
21564921507191185722…38180173629846978561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.312 × 10⁹⁸(99-digit number)
43129843014382371444…76360347259693957121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.625 × 10⁹⁸(99-digit number)
86259686028764742888…52720694519387914241
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,911,141 XPM·at block #6,833,367 · 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