Block #2,996,111

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 1/5/2019, 2:32:35 AM · Difficulty 11.2619 · 3,846,367 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
1a97eb77368dda2cf511d125011fbf52527cb144a473a6736ce95f965777ac25

Height

#2,996,111

Difficulty

11.261930

Transactions

27

Size

6.18 KB

Version

2

Bits

0b430ddc

Nonce

68,306,602

Timestamp

1/5/2019, 2:32:35 AM

Confirmations

3,846,367

Merkle Root

51c1bbaee5fe4120cbe6882566abac83e6fc7793976333634cfc317de70e7007
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.

5.756 × 10⁹⁵(96-digit number)
57563159533360722875…54829663568562216961
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
5.756 × 10⁹⁵(96-digit number)
57563159533360722875…54829663568562216961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.151 × 10⁹⁶(97-digit number)
11512631906672144575…09659327137124433921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.302 × 10⁹⁶(97-digit number)
23025263813344289150…19318654274248867841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.605 × 10⁹⁶(97-digit number)
46050527626688578300…38637308548497735681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
9.210 × 10⁹⁶(97-digit number)
92101055253377156601…77274617096995471361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.842 × 10⁹⁷(98-digit number)
18420211050675431320…54549234193990942721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.684 × 10⁹⁷(98-digit number)
36840422101350862640…09098468387981885441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
7.368 × 10⁹⁷(98-digit number)
73680844202701725280…18196936775963770881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.473 × 10⁹⁸(99-digit number)
14736168840540345056…36393873551927541761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.947 × 10⁹⁸(99-digit number)
29472337681080690112…72787747103855083521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.894 × 10⁹⁸(99-digit number)
58944675362161380224…45575494207710167041
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,984,241 XPM·at block #6,842,477 · 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