Block #2,653,594

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/8/2018, 12:58:54 PM · Difficulty 11.7357 · 4,179,432 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
9295d95bf16890e2f0a585713f4c2d5a2f64a90559b067961824bde5f24f80bf

Height

#2,653,594

Difficulty

11.735739

Transactions

33

Size

9.80 KB

Version

2

Bits

0bbc5965

Nonce

217,063,543

Timestamp

5/8/2018, 12:58:54 PM

Confirmations

4,179,432

Merkle Root

bac8a4282bbe0d58e3266060941d96b2d19c743843a60b898cf93e064952264a
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.419 × 10⁹⁴(95-digit number)
24195028058498623732…11512161336946810261
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.419 × 10⁹⁴(95-digit number)
24195028058498623732…11512161336946810261
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.839 × 10⁹⁴(95-digit number)
48390056116997247464…23024322673893620521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.678 × 10⁹⁴(95-digit number)
96780112233994494929…46048645347787241041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.935 × 10⁹⁵(96-digit number)
19356022446798898985…92097290695574482081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.871 × 10⁹⁵(96-digit number)
38712044893597797971…84194581391148964161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.742 × 10⁹⁵(96-digit number)
77424089787195595943…68389162782297928321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.548 × 10⁹⁶(97-digit number)
15484817957439119188…36778325564595856641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.096 × 10⁹⁶(97-digit number)
30969635914878238377…73556651129191713281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.193 × 10⁹⁶(97-digit number)
61939271829756476755…47113302258383426561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.238 × 10⁹⁷(98-digit number)
12387854365951295351…94226604516766853121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.477 × 10⁹⁷(98-digit number)
24775708731902590702…88453209033533706241
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,908,384 XPM·at block #6,833,025 · 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