Block #2,872,516

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 10/8/2018, 11:01:33 AM · Difficulty 11.6669 · 3,966,237 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
1a0cd063a42c93989ee7f4cfdacc2f66ffee1e07d5a18a167bf98585bf613809

Height

#2,872,516

Difficulty

11.666863

Transactions

13

Size

4.95 KB

Version

2

Bits

0baab782

Nonce

353,961,354

Timestamp

10/8/2018, 11:01:33 AM

Confirmations

3,966,237

Merkle Root

ab2cf2487ceb6f34bfbf4b911360e85ecf6e0ab8a084c5b765c15cc2fa8da3e1
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.265 × 10⁹⁵(96-digit number)
42651716783541745881…39640155716232499199
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.265 × 10⁹⁵(96-digit number)
42651716783541745881…39640155716232499199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.530 × 10⁹⁵(96-digit number)
85303433567083491763…79280311432464998399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.706 × 10⁹⁶(97-digit number)
17060686713416698352…58560622864929996799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.412 × 10⁹⁶(97-digit number)
34121373426833396705…17121245729859993599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.824 × 10⁹⁶(97-digit number)
68242746853666793410…34242491459719987199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.364 × 10⁹⁷(98-digit number)
13648549370733358682…68484982919439974399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.729 × 10⁹⁷(98-digit number)
27297098741466717364…36969965838879948799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.459 × 10⁹⁷(98-digit number)
54594197482933434728…73939931677759897599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.091 × 10⁹⁸(99-digit number)
10918839496586686945…47879863355519795199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.183 × 10⁹⁸(99-digit number)
21837678993173373891…95759726711039590399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
4.367 × 10⁹⁸(99-digit number)
43675357986346747782…91519453422079180799
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,954,282 XPM·at block #6,838,752 · 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