Block #2,989,267

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 12/31/2018, 7:32:58 AM · Difficulty 11.2697 · 3,854,593 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
5d43da7fa03169795309f5d9a1684bb03f2ea98883b73d3fab97935e5fe01f78

Height

#2,989,267

Difficulty

11.269728

Transactions

26

Size

5.72 KB

Version

2

Bits

0b450cde

Nonce

442,602,222

Timestamp

12/31/2018, 7:32:58 AM

Confirmations

3,854,593

Merkle Root

601c5262af89e20be59459b9bb37a347f92b362fecbf05ec6df48aa80cf97086
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.

6.847 × 10⁹⁶(97-digit number)
68472199321095187443…87175188963080110079
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
6.847 × 10⁹⁶(97-digit number)
68472199321095187443…87175188963080110079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.369 × 10⁹⁷(98-digit number)
13694439864219037488…74350377926160220159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.738 × 10⁹⁷(98-digit number)
27388879728438074977…48700755852320440319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.477 × 10⁹⁷(98-digit number)
54777759456876149955…97401511704640880639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.095 × 10⁹⁸(99-digit number)
10955551891375229991…94803023409281761279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.191 × 10⁹⁸(99-digit number)
21911103782750459982…89606046818563522559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.382 × 10⁹⁸(99-digit number)
43822207565500919964…79212093637127045119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.764 × 10⁹⁸(99-digit number)
87644415131001839928…58424187274254090239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.752 × 10⁹⁹(100-digit number)
17528883026200367985…16848374548508180479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.505 × 10⁹⁹(100-digit number)
35057766052400735971…33696749097016360959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.011 × 10⁹⁹(100-digit number)
70115532104801471942…67393498194032721919
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,995,248 XPM·at block #6,843,859 · 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