Block #2,646,268

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/3/2018, 6:57:54 AM · Difficulty 11.7473 · 4,187,420 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0bd46a9b3b644817226c347e5cc399e5894cc1494542f4a790b0364ba235068f

Height

#2,646,268

Difficulty

11.747332

Transactions

13

Size

5.21 KB

Version

2

Bits

0bbf5128

Nonce

460,188,751

Timestamp

5/3/2018, 6:57:54 AM

Confirmations

4,187,420

Merkle Root

80097a2602054c245ab6fccb2231ed0fad8b80338351de80f1118a58a83fe871
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.218 × 10⁹⁴(95-digit number)
92188729087591650115…50671065271813307201
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.218 × 10⁹⁴(95-digit number)
92188729087591650115…50671065271813307201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.843 × 10⁹⁵(96-digit number)
18437745817518330023…01342130543626614401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.687 × 10⁹⁵(96-digit number)
36875491635036660046…02684261087253228801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.375 × 10⁹⁵(96-digit number)
73750983270073320092…05368522174506457601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.475 × 10⁹⁶(97-digit number)
14750196654014664018…10737044349012915201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.950 × 10⁹⁶(97-digit number)
29500393308029328036…21474088698025830401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.900 × 10⁹⁶(97-digit number)
59000786616058656073…42948177396051660801
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.180 × 10⁹⁷(98-digit number)
11800157323211731214…85896354792103321601
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.360 × 10⁹⁷(98-digit number)
23600314646423462429…71792709584206643201
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.720 × 10⁹⁷(98-digit number)
47200629292846924858…43585419168413286401
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.440 × 10⁹⁷(98-digit number)
94401258585693849717…87170838336826572801
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,913,725 XPM·at block #6,833,687 · 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