Block #2,826,941

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/6/2018, 7:21:19 AM · Difficulty 11.7101 · 4,004,820 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
d5b2d32476b3d050044ab838917ea6ca30399a0c846fa26ecbfbe87bbdb1679e

Height

#2,826,941

Difficulty

11.710091

Transactions

7

Size

2.32 KB

Version

2

Bits

0bb5c87e

Nonce

1,709,945,522

Timestamp

9/6/2018, 7:21:19 AM

Confirmations

4,004,820

Merkle Root

3c10b03c661195091f557db5e61ca6ef92b8663c3751f9e8a89bd39248275ff8
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.189 × 10⁹³(94-digit number)
51892851005796505636…46499150811915586999
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.189 × 10⁹³(94-digit number)
51892851005796505636…46499150811915586999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.037 × 10⁹⁴(95-digit number)
10378570201159301127…92998301623831173999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.075 × 10⁹⁴(95-digit number)
20757140402318602254…85996603247662347999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.151 × 10⁹⁴(95-digit number)
41514280804637204509…71993206495324695999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.302 × 10⁹⁴(95-digit number)
83028561609274409018…43986412990649391999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.660 × 10⁹⁵(96-digit number)
16605712321854881803…87972825981298783999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.321 × 10⁹⁵(96-digit number)
33211424643709763607…75945651962597567999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.642 × 10⁹⁵(96-digit number)
66422849287419527215…51891303925195135999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.328 × 10⁹⁶(97-digit number)
13284569857483905443…03782607850390271999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.656 × 10⁹⁶(97-digit number)
26569139714967810886…07565215700780543999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.313 × 10⁹⁶(97-digit number)
53138279429935621772…15130431401561087999
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,898,197 XPM·at block #6,831,760 · 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