Block #2,792,626

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/13/2018, 8:13:07 PM · Difficulty 11.6769 · 4,050,723 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8d3a3a5ad06ea7c07406dcf44330300750fa635fcb5f9133d44f5f25df681459

Height

#2,792,626

Difficulty

11.676858

Transactions

7

Size

1.90 KB

Version

2

Bits

0bad468e

Nonce

886,229,281

Timestamp

8/13/2018, 8:13:07 PM

Confirmations

4,050,723

Merkle Root

6c7bb48ef4d5f0ebb93ee98701181d003f0e68d256d50b09f7b5683e09314c79
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.987 × 10⁹⁵(96-digit number)
89877270903223987671…34182424819040936959
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.987 × 10⁹⁵(96-digit number)
89877270903223987671…34182424819040936959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.797 × 10⁹⁶(97-digit number)
17975454180644797534…68364849638081873919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.595 × 10⁹⁶(97-digit number)
35950908361289595068…36729699276163747839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.190 × 10⁹⁶(97-digit number)
71901816722579190137…73459398552327495679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.438 × 10⁹⁷(98-digit number)
14380363344515838027…46918797104654991359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.876 × 10⁹⁷(98-digit number)
28760726689031676054…93837594209309982719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.752 × 10⁹⁷(98-digit number)
57521453378063352109…87675188418619965439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.150 × 10⁹⁸(99-digit number)
11504290675612670421…75350376837239930879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.300 × 10⁹⁸(99-digit number)
23008581351225340843…50700753674479861759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.601 × 10⁹⁸(99-digit number)
46017162702450681687…01401507348959723519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
9.203 × 10⁹⁸(99-digit number)
92034325404901363375…02803014697919447039
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,991,153 XPM·at block #6,843,348 · 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