Block #2,595,027

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 4/1/2018, 6:06:47 AM · Difficulty 11.3017 · 4,236,608 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f34c14a4a9f07d1c605f461b7d35c5c0c1e01075b0c4740faac18ecad5506ddf

Height

#2,595,027

Difficulty

11.301670

Transactions

3

Size

7.28 KB

Version

2

Bits

0b4d3a45

Nonce

555,778,175

Timestamp

4/1/2018, 6:06:47 AM

Confirmations

4,236,608

Merkle Root

f33ed847e983d51e11c76b4c735549cfdadc3ed0c13627e5930214f15626b9c1
Transactions (3)
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.

3.748 × 10⁹⁵(96-digit number)
37487067526451582382…74773480586832720641
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
3.748 × 10⁹⁵(96-digit number)
37487067526451582382…74773480586832720641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
7.497 × 10⁹⁵(96-digit number)
74974135052903164764…49546961173665441281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.499 × 10⁹⁶(97-digit number)
14994827010580632952…99093922347330882561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.998 × 10⁹⁶(97-digit number)
29989654021161265905…98187844694661765121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.997 × 10⁹⁶(97-digit number)
59979308042322531811…96375689389323530241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.199 × 10⁹⁷(98-digit number)
11995861608464506362…92751378778647060481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.399 × 10⁹⁷(98-digit number)
23991723216929012724…85502757557294120961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.798 × 10⁹⁷(98-digit number)
47983446433858025449…71005515114588241921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
9.596 × 10⁹⁷(98-digit number)
95966892867716050898…42011030229176483841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.919 × 10⁹⁸(99-digit number)
19193378573543210179…84022060458352967681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.838 × 10⁹⁸(99-digit number)
38386757147086420359…68044120916705935361
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,183 XPM·at block #6,831,634 · 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