Block #2,825,518

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/5/2018, 7:45:19 AM · Difficulty 11.7096 · 4,017,478 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3718f6ae7878a51efba6d07c0ce6f4e9c503ef40dba405355461b941b46b105b

Height

#2,825,518

Difficulty

11.709583

Transactions

4

Size

1.40 KB

Version

2

Bits

0bb5a73c

Nonce

561,786,383

Timestamp

9/5/2018, 7:45:19 AM

Confirmations

4,017,478

Merkle Root

5dc1d692418c6349d115794878288f807a188df5572cb95c1f8bc13b39c6dee1
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.027 × 10⁹⁴(95-digit number)
20274245807702045690…28866911923581431521
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.027 × 10⁹⁴(95-digit number)
20274245807702045690…28866911923581431521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.054 × 10⁹⁴(95-digit number)
40548491615404091381…57733823847162863041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
8.109 × 10⁹⁴(95-digit number)
81096983230808182762…15467647694325726081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.621 × 10⁹⁵(96-digit number)
16219396646161636552…30935295388651452161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.243 × 10⁹⁵(96-digit number)
32438793292323273104…61870590777302904321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.487 × 10⁹⁵(96-digit number)
64877586584646546209…23741181554605808641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.297 × 10⁹⁶(97-digit number)
12975517316929309241…47482363109211617281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.595 × 10⁹⁶(97-digit number)
25951034633858618483…94964726218423234561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.190 × 10⁹⁶(97-digit number)
51902069267717236967…89929452436846469121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.038 × 10⁹⁷(98-digit number)
10380413853543447393…79858904873692938241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.076 × 10⁹⁷(98-digit number)
20760827707086894787…59717809747385876481
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,988,323 XPM·at block #6,842,995 · 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