Block #2,927,000

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 11/17/2018, 2:21:28 PM · Difficulty 11.3601 · 3,918,023 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
43480557d504ac2d78bd5ec894931bb466b8e9baae243ee99b76606b3cdb29d0

Height

#2,927,000

Difficulty

11.360062

Transactions

4

Size

1.63 KB

Version

2

Bits

0b5c2d06

Nonce

1,036,969,103

Timestamp

11/17/2018, 2:21:28 PM

Confirmations

3,918,023

Merkle Root

376e8217b636f50d0d56d6f3ffd09c3553f4b1336fc690192a8af75e38c308b3
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.

5.191 × 10⁹⁶(97-digit number)
51918721344217820410…57113237613538821121
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
5.191 × 10⁹⁶(97-digit number)
51918721344217820410…57113237613538821121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.038 × 10⁹⁷(98-digit number)
10383744268843564082…14226475227077642241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.076 × 10⁹⁷(98-digit number)
20767488537687128164…28452950454155284481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
4.153 × 10⁹⁷(98-digit number)
41534977075374256328…56905900908310568961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
8.306 × 10⁹⁷(98-digit number)
83069954150748512657…13811801816621137921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.661 × 10⁹⁸(99-digit number)
16613990830149702531…27623603633242275841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
3.322 × 10⁹⁸(99-digit number)
33227981660299405062…55247207266484551681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
6.645 × 10⁹⁸(99-digit number)
66455963320598810125…10494414532969103361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.329 × 10⁹⁹(100-digit number)
13291192664119762025…20988829065938206721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.658 × 10⁹⁹(100-digit number)
26582385328239524050…41977658131876413441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
5.316 × 10⁹⁹(100-digit number)
53164770656479048100…83955316263752826881
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:58,004,608 XPM·at block #6,845,022 · 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