Block #2,860,058

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 9/29/2018, 5:13:24 PM · Difficulty 11.6752 · 3,972,515 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
e5cf3fc4292d900b257a7055e0a5a3b409bac635431ad8a12fdf020863feeef7

Height

#2,860,058

Difficulty

11.675190

Transactions

4

Size

12.93 KB

Version

2

Bits

0bacd939

Nonce

156,930,255

Timestamp

9/29/2018, 5:13:24 PM

Confirmations

3,972,515

Merkle Root

4902a5537ad1513e2145c809112b96bec87473392d0e932614cf6055aa4c4222
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.135 × 10⁹⁴(95-digit number)
31359082429231096580…18179067237439642881
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.135 × 10⁹⁴(95-digit number)
31359082429231096580…18179067237439642881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
6.271 × 10⁹⁴(95-digit number)
62718164858462193161…36358134474879285761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.254 × 10⁹⁵(96-digit number)
12543632971692438632…72716268949758571521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.508 × 10⁹⁵(96-digit number)
25087265943384877264…45432537899517143041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
5.017 × 10⁹⁵(96-digit number)
50174531886769754529…90865075799034286081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.003 × 10⁹⁶(97-digit number)
10034906377353950905…81730151598068572161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.006 × 10⁹⁶(97-digit number)
20069812754707901811…63460303196137144321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
4.013 × 10⁹⁶(97-digit number)
40139625509415803623…26920606392274288641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
8.027 × 10⁹⁶(97-digit number)
80279251018831607247…53841212784548577281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.605 × 10⁹⁷(98-digit number)
16055850203766321449…07682425569097154561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
3.211 × 10⁹⁷(98-digit number)
32111700407532642898…15364851138194309121
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,904,743 XPM·at block #6,832,572 · 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