Block #2,822,481

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 9/3/2018, 7:02:28 AM · Difficulty 11.7029 · 4,014,153 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5d3b9eb8cc0fd92a3746ff85fe53f03fb75b84d14ff50323cdd62864e076cc9e

Height

#2,822,481

Difficulty

11.702852

Transactions

22

Size

6.90 KB

Version

2

Bits

0bb3ee23

Nonce

183,785,095

Timestamp

9/3/2018, 7:02:28 AM

Confirmations

4,014,153

Merkle Root

03a1acc1e8e1dae3ead95fd310d2570133906e7377caf5b500d44ccc9bc4d4ca
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.

4.127 × 10⁹⁴(95-digit number)
41275951498142155327…48022549023304861559
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
4.127 × 10⁹⁴(95-digit number)
41275951498142155327…48022549023304861559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.255 × 10⁹⁴(95-digit number)
82551902996284310654…96045098046609723119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.651 × 10⁹⁵(96-digit number)
16510380599256862130…92090196093219446239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.302 × 10⁹⁵(96-digit number)
33020761198513724261…84180392186438892479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.604 × 10⁹⁵(96-digit number)
66041522397027448523…68360784372877784959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.320 × 10⁹⁶(97-digit number)
13208304479405489704…36721568745755569919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.641 × 10⁹⁶(97-digit number)
26416608958810979409…73443137491511139839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.283 × 10⁹⁶(97-digit number)
52833217917621958818…46886274983022279679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.056 × 10⁹⁷(98-digit number)
10566643583524391763…93772549966044559359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.113 × 10⁹⁷(98-digit number)
21133287167048783527…87545099932089118719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.226 × 10⁹⁷(98-digit number)
42266574334097567055…75090199864178237439
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,937,344 XPM·at block #6,836,633 · 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