Block #2,805,543

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/22/2018, 9:59:24 PM · Difficulty 11.6676 · 4,002,283 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
482ce6dcb00415a0be31b6084d2579596e3670c7328760ed8e22ba6db5e366dd

Height

#2,805,543

Difficulty

11.667631

Transactions

6

Size

1.94 KB

Version

2

Bits

0baae9d7

Nonce

771,425,233

Timestamp

8/22/2018, 9:59:24 PM

Confirmations

4,002,283

Merkle Root

1c76a7f887800baf2ce71a8fc295da483eb0c0f736099a9fd7c7b849fbb53105
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.

4.044 × 10⁹⁶(97-digit number)
40449076929353189337…98043139124115121921
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
4.044 × 10⁹⁶(97-digit number)
40449076929353189337…98043139124115121921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
8.089 × 10⁹⁶(97-digit number)
80898153858706378675…96086278248230243841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.617 × 10⁹⁷(98-digit number)
16179630771741275735…92172556496460487681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.235 × 10⁹⁷(98-digit number)
32359261543482551470…84345112992920975361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
6.471 × 10⁹⁷(98-digit number)
64718523086965102940…68690225985841950721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.294 × 10⁹⁸(99-digit number)
12943704617393020588…37380451971683901441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.588 × 10⁹⁸(99-digit number)
25887409234786041176…74760903943367802881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.177 × 10⁹⁸(99-digit number)
51774818469572082352…49521807886735605761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.035 × 10⁹⁹(100-digit number)
10354963693914416470…99043615773471211521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.070 × 10⁹⁹(100-digit number)
20709927387828832940…98087231546942423041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
4.141 × 10⁹⁹(100-digit number)
41419854775657665881…96174463093884846081
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,706,643 XPM·at block #6,807,825 · 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.

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