Block #2,838,371

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/14/2018, 3:25:04 AM · Difficulty 11.7187 · 3,992,513 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
500f1fe1295c65715a7b77e5d21cee7c346b6d18450367c4377fcf17370b37c2

Height

#2,838,371

Difficulty

11.718685

Transactions

5

Size

1.12 KB

Version

2

Bits

0bb7fbbc

Nonce

615,014,778

Timestamp

9/14/2018, 3:25:04 AM

Confirmations

3,992,513

Merkle Root

34c48572d070bc4133bb7ad15d389df52606f3ad8bc6d59ecccce8d0fb745eb2
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.

9.975 × 10⁹²(93-digit number)
99755414052018699666…80349021090344053721
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
9.975 × 10⁹²(93-digit number)
99755414052018699666…80349021090344053721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.995 × 10⁹³(94-digit number)
19951082810403739933…60698042180688107441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.990 × 10⁹³(94-digit number)
39902165620807479866…21396084361376214881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.980 × 10⁹³(94-digit number)
79804331241614959733…42792168722752429761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.596 × 10⁹⁴(95-digit number)
15960866248322991946…85584337445504859521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.192 × 10⁹⁴(95-digit number)
31921732496645983893…71168674891009719041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
6.384 × 10⁹⁴(95-digit number)
63843464993291967786…42337349782019438081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.276 × 10⁹⁵(96-digit number)
12768692998658393557…84674699564038876161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.553 × 10⁹⁵(96-digit number)
25537385997316787114…69349399128077752321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
5.107 × 10⁹⁵(96-digit number)
51074771994633574229…38698798256155504641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.021 × 10⁹⁶(97-digit number)
10214954398926714845…77397596512311009281
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,891,208 XPM·at block #6,830,883 · 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