Block #2,657,427

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 5/12/2018, 12:01:09 AM · Difficulty 11.6680 · 4,184,016 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
f38c4835e65236d2914f6009fac33757b3ce1c5a7452a963c50cf4c4b92d9b6a

Height

#2,657,427

Difficulty

11.668034

Transactions

38

Size

10.39 KB

Version

2

Bits

0bab0444

Nonce

1,853,808,834

Timestamp

5/12/2018, 12:01:09 AM

Confirmations

4,184,016

Merkle Root

e788ace7e269b13e85e02b7aa28b8b073ef02bcacc42356216c32c7d578046c0
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.352 × 10⁹²(93-digit number)
23521931925573210020…67566745484365125001
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.352 × 10⁹²(93-digit number)
23521931925573210020…67566745484365125001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
4.704 × 10⁹²(93-digit number)
47043863851146420041…35133490968730250001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
9.408 × 10⁹²(93-digit number)
94087727702292840082…70266981937460500001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.881 × 10⁹³(94-digit number)
18817545540458568016…40533963874921000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.763 × 10⁹³(94-digit number)
37635091080917136032…81067927749842000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
7.527 × 10⁹³(94-digit number)
75270182161834272065…62135855499684000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.505 × 10⁹⁴(95-digit number)
15054036432366854413…24271710999368000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.010 × 10⁹⁴(95-digit number)
30108072864733708826…48543421998736000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.021 × 10⁹⁴(95-digit number)
60216145729467417652…97086843997472000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.204 × 10⁹⁵(96-digit number)
12043229145893483530…94173687994944000001
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
2.408 × 10⁹⁵(96-digit number)
24086458291786967060…88347375989888000001
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,975,924 XPM·at block #6,841,442 · 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