Block #2,654,298

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/9/2018, 4:44:04 AM · Difficulty 11.7229 · 4,187,431 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d7c72aff492d35ef7ab2ae25148721db9e9df320f2b2ee36b9b561e7fdac005b

Height

#2,654,298

Difficulty

11.722901

Transactions

2

Size

426 B

Version

2

Bits

0bb9100d

Nonce

558,603,101

Timestamp

5/9/2018, 4:44:04 AM

Confirmations

4,187,431

Merkle Root

182eec9393f93f0b3e67f6ba63005a68c89a0b6068a976d3dc0ba5b45e3db855
Transactions (2)
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.

8.943 × 10⁹⁴(95-digit number)
89430953478364597823…74646895683711713281
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
8.943 × 10⁹⁴(95-digit number)
89430953478364597823…74646895683711713281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.788 × 10⁹⁵(96-digit number)
17886190695672919564…49293791367423426561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
3.577 × 10⁹⁵(96-digit number)
35772381391345839129…98587582734846853121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
7.154 × 10⁹⁵(96-digit number)
71544762782691678259…97175165469693706241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.430 × 10⁹⁶(97-digit number)
14308952556538335651…94350330939387412481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.861 × 10⁹⁶(97-digit number)
28617905113076671303…88700661878774824961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
5.723 × 10⁹⁶(97-digit number)
57235810226153342607…77401323757549649921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.144 × 10⁹⁷(98-digit number)
11447162045230668521…54802647515099299841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
2.289 × 10⁹⁷(98-digit number)
22894324090461337042…09605295030198599681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
4.578 × 10⁹⁷(98-digit number)
45788648180922674085…19210590060397199361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
9.157 × 10⁹⁷(98-digit number)
91577296361845348171…38421180120794398721
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,213 XPM·at block #6,841,728 · 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