Block #2,950,718

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 12/3/2018, 9:13:18 PM · Difficulty 11.3939 · 3,880,924 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
0686272c3842bbaff8298da93c86efd18700ee074ff7f7f6e62b23f1b4388385

Height

#2,950,718

Difficulty

11.393888

Transactions

20

Size

5.96 KB

Version

2

Bits

0b64d5d2

Nonce

365,089,908

Timestamp

12/3/2018, 9:13:18 PM

Confirmations

3,880,924

Merkle Root

6fb54a5d3ececef5599605e6b757260bc3f6b0d205a4afa6ef90711ae5bc5218
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.416 × 10⁹⁵(96-digit number)
24163241571034077209…64498636086999183841
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.416 × 10⁹⁵(96-digit number)
24163241571034077209…64498636086999183841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.832 × 10⁹⁵(96-digit number)
48326483142068154419…28997272173998367681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.665 × 10⁹⁵(96-digit number)
96652966284136308839…57994544347996735361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.933 × 10⁹⁶(97-digit number)
19330593256827261767…15989088695993470721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.866 × 10⁹⁶(97-digit number)
38661186513654523535…31978177391986941441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.732 × 10⁹⁶(97-digit number)
77322373027309047071…63956354783973882881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.546 × 10⁹⁷(98-digit number)
15464474605461809414…27912709567947765761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.092 × 10⁹⁷(98-digit number)
30928949210923618828…55825419135895531521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.185 × 10⁹⁷(98-digit number)
61857898421847237657…11650838271791063041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.237 × 10⁹⁸(99-digit number)
12371579684369447531…23301676543582126081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.474 × 10⁹⁸(99-digit number)
24743159368738895062…46603353087164252161
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,897,233 XPM·at block #6,831,640 · 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