Block #2,799,801

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/18/2018, 8:29:57 PM · Difficulty 11.6744 · 4,042,662 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e75264ea11203b79eb701390c49c5093f9b856f4b5832348075635d88ea3f7d8

Height

#2,799,801

Difficulty

11.674375

Transactions

11

Size

3.57 KB

Version

2

Bits

0baca3d6

Nonce

445,189,128

Timestamp

8/18/2018, 8:29:57 PM

Confirmations

4,042,662

Merkle Root

0f8c68acd992cb8ad36d57301f5ae26ae753d8ea11779897caea38ae456bb412
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.439 × 10⁹⁴(95-digit number)
14391856557778871275…24484803930014622059
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.439 × 10⁹⁴(95-digit number)
14391856557778871275…24484803930014622059
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.878 × 10⁹⁴(95-digit number)
28783713115557742551…48969607860029244119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.756 × 10⁹⁴(95-digit number)
57567426231115485103…97939215720058488239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.151 × 10⁹⁵(96-digit number)
11513485246223097020…95878431440116976479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.302 × 10⁹⁵(96-digit number)
23026970492446194041…91756862880233952959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.605 × 10⁹⁵(96-digit number)
46053940984892388082…83513725760467905919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
9.210 × 10⁹⁵(96-digit number)
92107881969784776165…67027451520935811839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.842 × 10⁹⁶(97-digit number)
18421576393956955233…34054903041871623679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.684 × 10⁹⁶(97-digit number)
36843152787913910466…68109806083743247359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
7.368 × 10⁹⁶(97-digit number)
73686305575827820932…36219612167486494719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.473 × 10⁹⁷(98-digit number)
14737261115165564186…72439224334972989439
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,984,122 XPM·at block #6,842,462 · 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