Block #2,759,724

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/22/2018, 3:54:11 AM · Difficulty 11.6597 · 4,074,180 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
a48ae9dbf795b0c342a7a99eac8e8e4723c8358a624b39605b33db79ed639adf

Height

#2,759,724

Difficulty

11.659708

Transactions

5

Size

1.61 KB

Version

2

Bits

0ba8e29c

Nonce

336,342,703

Timestamp

7/22/2018, 3:54:11 AM

Confirmations

4,074,180

Merkle Root

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

1.198 × 10⁹⁶(97-digit number)
11983716723693988653…67289690106167726081
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
1.198 × 10⁹⁶(97-digit number)
11983716723693988653…67289690106167726081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.396 × 10⁹⁶(97-digit number)
23967433447387977307…34579380212335452161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.793 × 10⁹⁶(97-digit number)
47934866894775954614…69158760424670904321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.586 × 10⁹⁶(97-digit number)
95869733789551909229…38317520849341808641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.917 × 10⁹⁷(98-digit number)
19173946757910381845…76635041698683617281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.834 × 10⁹⁷(98-digit number)
38347893515820763691…53270083397367234561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.669 × 10⁹⁷(98-digit number)
76695787031641527383…06540166794734469121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.533 × 10⁹⁸(99-digit number)
15339157406328305476…13080333589468938241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.067 × 10⁹⁸(99-digit number)
30678314812656610953…26160667178937876481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.135 × 10⁹⁸(99-digit number)
61356629625313221906…52321334357875752961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.227 × 10⁹⁹(100-digit number)
12271325925062644381…04642668715751505921
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,915,458 XPM·at block #6,833,903 · 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