Block #2,882,757

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/15/2018, 11:11:58 PM · Difficulty 11.6275 · 3,950,173 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8e8197e8b412410eceb42dadc39eb6f2d01041daa25e10e3d492d7e42e9f82b7

Height

#2,882,757

Difficulty

11.627506

Transactions

8

Size

3.90 KB

Version

2

Bits

0ba0a434

Nonce

1,265,309,702

Timestamp

10/15/2018, 11:11:58 PM

Confirmations

3,950,173

Merkle Root

7b67fd5c92d4f14081589aec390813a9f7619b3877cbebc321a6fc86999473fa
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.654 × 10⁹⁵(96-digit number)
86546181399386665946…34307267254745804799
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.654 × 10⁹⁵(96-digit number)
86546181399386665946…34307267254745804799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.730 × 10⁹⁶(97-digit number)
17309236279877333189…68614534509491609599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.461 × 10⁹⁶(97-digit number)
34618472559754666378…37229069018983219199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.923 × 10⁹⁶(97-digit number)
69236945119509332757…74458138037966438399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.384 × 10⁹⁷(98-digit number)
13847389023901866551…48916276075932876799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.769 × 10⁹⁷(98-digit number)
27694778047803733102…97832552151865753599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.538 × 10⁹⁷(98-digit number)
55389556095607466205…95665104303731507199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.107 × 10⁹⁸(99-digit number)
11077911219121493241…91330208607463014399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.215 × 10⁹⁸(99-digit number)
22155822438242986482…82660417214926028799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.431 × 10⁹⁸(99-digit number)
44311644876485972964…65320834429852057599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
8.862 × 10⁹⁸(99-digit number)
88623289752971945929…30641668859704115199
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,907,616 XPM·at block #6,832,929 · 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