Block #2,716,497

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 6/22/2018, 1:34:22 PM · Difficulty 11.6146 · 4,114,553 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
90c5a307ce62c121192e514f3f8b8ba5b9515f719098fffc1d489d00a6bcc9c2

Height

#2,716,497

Difficulty

11.614642

Transactions

2

Size

722 B

Version

2

Bits

0b9d5927

Nonce

288,940,228

Timestamp

6/22/2018, 1:34:22 PM

Confirmations

4,114,553

Merkle Root

59b0c88c2f94190568929644793c3358ab33fa18cf86e11da6f036948647a084
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.

2.984 × 10⁹³(94-digit number)
29849257679561471399…20558992981571466841
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.984 × 10⁹³(94-digit number)
29849257679561471399…20558992981571466841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.969 × 10⁹³(94-digit number)
59698515359122942798…41117985963142933681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.193 × 10⁹⁴(95-digit number)
11939703071824588559…82235971926285867361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.387 × 10⁹⁴(95-digit number)
23879406143649177119…64471943852571734721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.775 × 10⁹⁴(95-digit number)
47758812287298354238…28943887705143469441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
9.551 × 10⁹⁴(95-digit number)
95517624574596708476…57887775410286938881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.910 × 10⁹⁵(96-digit number)
19103524914919341695…15775550820573877761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.820 × 10⁹⁵(96-digit number)
38207049829838683390…31551101641147755521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
7.641 × 10⁹⁵(96-digit number)
76414099659677366781…63102203282295511041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.528 × 10⁹⁶(97-digit number)
15282819931935473356…26204406564591022081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.056 × 10⁹⁶(97-digit number)
30565639863870946712…52408813129182044161
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,892,536 XPM·at block #6,831,049 · 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