Block #2,641,938

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/1/2018, 1:11:06 PM · Difficulty 11.6372 · 4,200,525 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
fc5c66e8ba4e5776146665b9faf44394013a4db6661823e7029cb6920536e9fb

Height

#2,641,938

Difficulty

11.637172

Transactions

5

Size

54.97 KB

Version

2

Bits

0ba31dae

Nonce

220,576,141

Timestamp

5/1/2018, 1:11:06 PM

Confirmations

4,200,525

Merkle Root

74b1f4c5e62f9bc8969b7484f26674b467d25e930c5edf64cb0b079b3b59f733
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.955 × 10⁹⁴(95-digit number)
89556023921831263508…79967785608920236321
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.955 × 10⁹⁴(95-digit number)
89556023921831263508…79967785608920236321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.791 × 10⁹⁵(96-digit number)
17911204784366252701…59935571217840472641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.582 × 10⁹⁵(96-digit number)
35822409568732505403…19871142435680945281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.164 × 10⁹⁵(96-digit number)
71644819137465010806…39742284871361890561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.432 × 10⁹⁶(97-digit number)
14328963827493002161…79484569742723781121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.865 × 10⁹⁶(97-digit number)
28657927654986004322…58969139485447562241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.731 × 10⁹⁶(97-digit number)
57315855309972008645…17938278970895124481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.146 × 10⁹⁷(98-digit number)
11463171061994401729…35876557941790248961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.292 × 10⁹⁷(98-digit number)
22926342123988803458…71753115883580497921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.585 × 10⁹⁷(98-digit number)
45852684247977606916…43506231767160995841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.170 × 10⁹⁷(98-digit number)
91705368495955213832…87012463534321991681
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,984,122 XPM·at block #6,842,462 · 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