Block #2,817,546

2CCLength 11★★★☆☆

Cunningham Chain of the Second Kind · Discovered 8/30/2018, 10:53:40 PM · Difficulty 11.6951 · 4,016,414 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
3bac99e68eceaa4702c7dba142e41cd1d1adb52181e8fa1dc8d7e760eb31d74d

Height

#2,817,546

Difficulty

11.695067

Transactions

3

Size

2.92 KB

Version

2

Bits

0bb1eff1

Nonce

803,995,998

Timestamp

8/30/2018, 10:53:40 PM

Confirmations

4,016,414

Merkle Root

40c7e57e7cb88053951faf92522e661ace6587cc11c33dd966eb8ed81a4e3df6
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.

1.245 × 10⁹⁶(97-digit number)
12453946863594308283…74221146344383536961
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
1.245 × 10⁹⁶(97-digit number)
12453946863594308283…74221146344383536961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.490 × 10⁹⁶(97-digit number)
24907893727188616566…48442292688767073921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
4.981 × 10⁹⁶(97-digit number)
49815787454377233132…96884585377534147841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
9.963 × 10⁹⁶(97-digit number)
99631574908754466264…93769170755068295681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.992 × 10⁹⁷(98-digit number)
19926314981750893252…87538341510136591361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
3.985 × 10⁹⁷(98-digit number)
39852629963501786505…75076683020273182721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
7.970 × 10⁹⁷(98-digit number)
79705259927003573011…50153366040546365441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.594 × 10⁹⁸(99-digit number)
15941051985400714602…00306732081092730881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.188 × 10⁹⁸(99-digit number)
31882103970801429204…00613464162185461761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.376 × 10⁹⁸(99-digit number)
63764207941602858409…01226928324370923521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
11
2^10 × origin + 1
1.275 × 10⁹⁹(100-digit number)
12752841588320571681…02453856648741847041
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,915,908 XPM·at block #6,833,959 · 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