Block #2,723,198

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/27/2018, 4:32:55 AM · Difficulty 11.6180 · 4,110,599 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
7ef84264d40c5985d45555532e841774e15435030c6d570975b10b3e44dd4479

Height

#2,723,198

Difficulty

11.618025

Transactions

4

Size

1.30 KB

Version

2

Bits

0b9e36e1

Nonce

1,081,555,675

Timestamp

6/27/2018, 4:32:55 AM

Confirmations

4,110,599

Merkle Root

ab3249f403e878e0813abdccbe01270225e2cb1e07145cc8e91d7193923f3190
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.166 × 10⁹⁵(96-digit number)
71668153025121937153…19238772091927982081
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.166 × 10⁹⁵(96-digit number)
71668153025121937153…19238772091927982081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.433 × 10⁹⁶(97-digit number)
14333630605024387430…38477544183855964161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.866 × 10⁹⁶(97-digit number)
28667261210048774861…76955088367711928321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.733 × 10⁹⁶(97-digit number)
57334522420097549722…53910176735423856641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.146 × 10⁹⁷(98-digit number)
11466904484019509944…07820353470847713281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.293 × 10⁹⁷(98-digit number)
22933808968039019888…15640706941695426561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.586 × 10⁹⁷(98-digit number)
45867617936078039777…31281413883390853121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
9.173 × 10⁹⁷(98-digit number)
91735235872156079555…62562827766781706241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.834 × 10⁹⁸(99-digit number)
18347047174431215911…25125655533563412481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.669 × 10⁹⁸(99-digit number)
36694094348862431822…50251311067126824961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
7.338 × 10⁹⁸(99-digit number)
73388188697724863644…00502622134253649921
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,914,598 XPM·at block #6,833,796 · 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