Block #2,676,370

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/24/2018, 7:55:57 PM · Difficulty 11.6981 · 4,167,670 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
4780625c44d4a60ec82640eed64e15009406b99c12a450a95593c38d6a3cee15

Height

#2,676,370

Difficulty

11.698126

Transactions

26

Size

7.91 KB

Version

2

Bits

0bb2b85f

Nonce

316,647,115

Timestamp

5/24/2018, 7:55:57 PM

Confirmations

4,167,670

Merkle Root

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

8.485 × 10⁹²(93-digit number)
84850954921329698395…12274747881434961281
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
8.485 × 10⁹²(93-digit number)
84850954921329698395…12274747881434961281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.697 × 10⁹³(94-digit number)
16970190984265939679…24549495762869922561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.394 × 10⁹³(94-digit number)
33940381968531879358…49098991525739845121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
6.788 × 10⁹³(94-digit number)
67880763937063758716…98197983051479690241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.357 × 10⁹⁴(95-digit number)
13576152787412751743…96395966102959380481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.715 × 10⁹⁴(95-digit number)
27152305574825503486…92791932205918760961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.430 × 10⁹⁴(95-digit number)
54304611149651006973…85583864411837521921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.086 × 10⁹⁵(96-digit number)
10860922229930201394…71167728823675043841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.172 × 10⁹⁵(96-digit number)
21721844459860402789…42335457647350087681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.344 × 10⁹⁵(96-digit number)
43443688919720805578…84670915294700175361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
8.688 × 10⁹⁵(96-digit number)
86887377839441611156…69341830589400350721
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,996,689 XPM·at block #6,844,039 · 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