Block #2,817,965

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/31/2018, 5:28:19 AM · Difficulty 11.6968 · 4,015,249 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
316c0b5fe7d7bcc349e0fcabb6a679ad325c0b41f0ed2b469d17e9466b34dda4

Height

#2,817,965

Difficulty

11.696752

Transactions

8

Size

2.31 KB

Version

2

Bits

0bb25e54

Nonce

230,158,311

Timestamp

8/31/2018, 5:28:19 AM

Confirmations

4,015,249

Merkle Root

374d117e37b2f33a25e10b8781be4bd95d04094fbd126f0887465032fd587ce2
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.963 × 10⁹³(94-digit number)
49631571176055550702…87158983815948336641
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.963 × 10⁹³(94-digit number)
49631571176055550702…87158983815948336641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.926 × 10⁹³(94-digit number)
99263142352111101405…74317967631896673281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.985 × 10⁹⁴(95-digit number)
19852628470422220281…48635935263793346561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.970 × 10⁹⁴(95-digit number)
39705256940844440562…97271870527586693121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.941 × 10⁹⁴(95-digit number)
79410513881688881124…94543741055173386241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.588 × 10⁹⁵(96-digit number)
15882102776337776224…89087482110346772481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.176 × 10⁹⁵(96-digit number)
31764205552675552449…78174964220693544961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.352 × 10⁹⁵(96-digit number)
63528411105351104899…56349928441387089921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.270 × 10⁹⁶(97-digit number)
12705682221070220979…12699856882774179841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.541 × 10⁹⁶(97-digit number)
25411364442140441959…25399713765548359681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.082 × 10⁹⁶(97-digit number)
50822728884280883919…50799427531096719361
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,909,898 XPM·at block #6,833,213 · 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