Block #2,576,586

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 3/20/2018, 10:18:17 PM · Difficulty 10.9957 · 4,267,881 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f3312e21f4f075fddb994ad4f36218ba5513491bf79c73a3ca778e05300786fc

Height

#2,576,586

Difficulty

10.995746

Transactions

3

Size

801 B

Version

2

Bits

0afee936

Nonce

282,299,347

Timestamp

3/20/2018, 10:18:17 PM

Confirmations

4,267,881

Merkle Root

fe1e16a828d0b5b6537f7d21ca0d53d8bf436892f3025a728dbb8414ffbf834a
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.

1.400 × 10⁹⁵(96-digit number)
14003448302476980837…09535685090115228161
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
1.400 × 10⁹⁵(96-digit number)
14003448302476980837…09535685090115228161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.800 × 10⁹⁵(96-digit number)
28006896604953961675…19071370180230456321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.601 × 10⁹⁵(96-digit number)
56013793209907923350…38142740360460912641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.120 × 10⁹⁶(97-digit number)
11202758641981584670…76285480720921825281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.240 × 10⁹⁶(97-digit number)
22405517283963169340…52570961441843650561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.481 × 10⁹⁶(97-digit number)
44811034567926338680…05141922883687301121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.962 × 10⁹⁶(97-digit number)
89622069135852677360…10283845767374602241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.792 × 10⁹⁷(98-digit number)
17924413827170535472…20567691534749204481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.584 × 10⁹⁷(98-digit number)
35848827654341070944…41135383069498408961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.169 × 10⁹⁷(98-digit number)
71697655308682141888…82270766138996817921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.433 × 10⁹⁸(99-digit number)
14339531061736428377…64541532277993635841
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:58,000,130 XPM·at block #6,844,466 · 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