Block #2,866,377

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 10/4/2018, 4:40:42 AM · Difficulty 11.6668 · 3,972,880 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9ac8df30506f8a77175d5211aee4956e4231dc76acce981d07b3af8bd7c314f3

Height

#2,866,377

Difficulty

11.666827

Transactions

32

Size

8.45 KB

Version

2

Bits

0baab52b

Nonce

126,627,955

Timestamp

10/4/2018, 4:40:42 AM

Confirmations

3,972,880

Merkle Root

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

7.012 × 10⁹³(94-digit number)
70123720397472089958…63575208106607435721
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
7.012 × 10⁹³(94-digit number)
70123720397472089958…63575208106607435721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.402 × 10⁹⁴(95-digit number)
14024744079494417991…27150416213214871441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.804 × 10⁹⁴(95-digit number)
28049488158988835983…54300832426429742881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.609 × 10⁹⁴(95-digit number)
56098976317977671966…08601664852859485761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.121 × 10⁹⁵(96-digit number)
11219795263595534393…17203329705718971521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.243 × 10⁹⁵(96-digit number)
22439590527191068786…34406659411437943041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.487 × 10⁹⁵(96-digit number)
44879181054382137573…68813318822875886081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.975 × 10⁹⁵(96-digit number)
89758362108764275146…37626637645751772161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.795 × 10⁹⁶(97-digit number)
17951672421752855029…75253275291503544321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.590 × 10⁹⁶(97-digit number)
35903344843505710058…50506550583007088641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.180 × 10⁹⁶(97-digit number)
71806689687011420117…01013101166014177281
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,958,340 XPM·at block #6,839,256 · 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