Block #2,762,468

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 7/24/2018, 2:50:17 AM · Difficulty 11.6549 · 4,079,243 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0f766875aa663b91b7479cc0c36a49bc9e9e9acd17faf3a33890e10729d8672f

Height

#2,762,468

Difficulty

11.654911

Transactions

6

Size

2.08 KB

Version

2

Bits

0ba7a839

Nonce

1,726,884,098

Timestamp

7/24/2018, 2:50:17 AM

Confirmations

4,079,243

Merkle Root

20ff4024aba8d811bedc6c1db1c44c6e5cee3d1be71ba7cb5ef8e11012cd38a5
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.

2.236 × 10⁹²(93-digit number)
22367012778834087526…77396878369080404481
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
2.236 × 10⁹²(93-digit number)
22367012778834087526…77396878369080404481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.473 × 10⁹²(93-digit number)
44734025557668175052…54793756738160808961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.946 × 10⁹²(93-digit number)
89468051115336350104…09587513476321617921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.789 × 10⁹³(94-digit number)
17893610223067270020…19175026952643235841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.578 × 10⁹³(94-digit number)
35787220446134540041…38350053905286471681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.157 × 10⁹³(94-digit number)
71574440892269080083…76700107810572943361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.431 × 10⁹⁴(95-digit number)
14314888178453816016…53400215621145886721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.862 × 10⁹⁴(95-digit number)
28629776356907632033…06800431242291773441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.725 × 10⁹⁴(95-digit number)
57259552713815264067…13600862484583546881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.145 × 10⁹⁵(96-digit number)
11451910542763052813…27201724969167093761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.290 × 10⁹⁵(96-digit number)
22903821085526105626…54403449938334187521
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,978,067 XPM·at block #6,841,710 · 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