Block #2,810,950

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/26/2018, 4:18:53 PM · Difficulty 11.6669 · 4,022,531 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8eb5a13ff382356130e74a6a7af76c71c3bc2fb5be26ec80d029af2c1a946f55

Height

#2,810,950

Difficulty

11.666945

Transactions

4

Size

1.30 KB

Version

2

Bits

0baabce1

Nonce

361,510,486

Timestamp

8/26/2018, 4:18:53 PM

Confirmations

4,022,531

Merkle Root

5b10314a15294e89b13c61aa5dbe7ce021b39287e44da442387d00bdb53777c6
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.

8.994 × 10⁹⁴(95-digit number)
89941872119847168769…37359982767490672399
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
8.994 × 10⁹⁴(95-digit number)
89941872119847168769…37359982767490672399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.798 × 10⁹⁵(96-digit number)
17988374423969433753…74719965534981344799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.597 × 10⁹⁵(96-digit number)
35976748847938867507…49439931069962689599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.195 × 10⁹⁵(96-digit number)
71953497695877735015…98879862139925379199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.439 × 10⁹⁶(97-digit number)
14390699539175547003…97759724279850758399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.878 × 10⁹⁶(97-digit number)
28781399078351094006…95519448559701516799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.756 × 10⁹⁶(97-digit number)
57562798156702188012…91038897119403033599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.151 × 10⁹⁷(98-digit number)
11512559631340437602…82077794238806067199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.302 × 10⁹⁷(98-digit number)
23025119262680875205…64155588477612134399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.605 × 10⁹⁷(98-digit number)
46050238525361750410…28311176955224268799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.210 × 10⁹⁷(98-digit number)
92100477050723500820…56622353910448537599
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,912,052 XPM·at block #6,833,480 · 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