Block #2,790,139

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/12/2018, 3:46:36 AM · Difficulty 11.6729 · 4,052,609 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e4b6c0e30e88adf8d1346f6afe752c82981307cd4129f9eb0fc305ea7bb9114e

Height

#2,790,139

Difficulty

11.672868

Transactions

32

Size

8.33 KB

Version

2

Bits

0bac410d

Nonce

626,062,162

Timestamp

8/12/2018, 3:46:36 AM

Confirmations

4,052,609

Merkle Root

30e12621787905a0a9d895b48af6268a19c80e1ac6858582169faef90663d965
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.334 × 10⁹⁶(97-digit number)
73346161149798639824…71076332782027745281
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.334 × 10⁹⁶(97-digit number)
73346161149798639824…71076332782027745281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.466 × 10⁹⁷(98-digit number)
14669232229959727964…42152665564055490561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.933 × 10⁹⁷(98-digit number)
29338464459919455929…84305331128110981121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.867 × 10⁹⁷(98-digit number)
58676928919838911859…68610662256221962241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.173 × 10⁹⁸(99-digit number)
11735385783967782371…37221324512443924481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.347 × 10⁹⁸(99-digit number)
23470771567935564743…74442649024887848961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.694 × 10⁹⁸(99-digit number)
46941543135871129487…48885298049775697921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.388 × 10⁹⁸(99-digit number)
93883086271742258975…97770596099551395841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.877 × 10⁹⁹(100-digit number)
18776617254348451795…95541192199102791681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.755 × 10⁹⁹(100-digit number)
37553234508696903590…91082384398205583361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.510 × 10⁹⁹(100-digit number)
75106469017393807180…82164768796411166721
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,986,321 XPM·at block #6,842,747 · 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