Block #2,641,491

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2018, 9:10:45 AM · Difficulty 11.6220 · 4,191,766 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
221ea6f05ca5cb575086c6e118f97a554b76787cda5ffc8bee19e95377806a22

Height

#2,641,491

Difficulty

11.621955

Transactions

3

Size

1.07 KB

Version

2

Bits

0b9f386e

Nonce

1,293,954,922

Timestamp

5/1/2018, 9:10:45 AM

Confirmations

4,191,766

Merkle Root

436f3b30d158ddc2ca36d25051b17af40a96e8edb4a5cb92434379db54356c69
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.429 × 10⁹⁴(95-digit number)
54295124804540176944…88400130559735885641
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.429 × 10⁹⁴(95-digit number)
54295124804540176944…88400130559735885641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.085 × 10⁹⁵(96-digit number)
10859024960908035388…76800261119471771281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.171 × 10⁹⁵(96-digit number)
21718049921816070777…53600522238943542561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.343 × 10⁹⁵(96-digit number)
43436099843632141555…07201044477887085121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.687 × 10⁹⁵(96-digit number)
86872199687264283111…14402088955774170241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.737 × 10⁹⁶(97-digit number)
17374439937452856622…28804177911548340481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.474 × 10⁹⁶(97-digit number)
34748879874905713244…57608355823096680961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.949 × 10⁹⁶(97-digit number)
69497759749811426489…15216711646193361921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.389 × 10⁹⁷(98-digit number)
13899551949962285297…30433423292386723841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.779 × 10⁹⁷(98-digit number)
27799103899924570595…60866846584773447681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.559 × 10⁹⁷(98-digit number)
55598207799849141191…21733693169546895361
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,910,247 XPM·at block #6,833,256 · 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