Block #2,795,363

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/15/2018, 4:56:57 PM · Difficulty 11.6804 · 4,046,366 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
e4fcb7ac01c43b36b5288ba67c9609e062ce187d8d09d8bad5cf62192957270a

Height

#2,795,363

Difficulty

11.680424

Transactions

35

Size

11.59 KB

Version

2

Bits

0bae303f

Nonce

333,141,297

Timestamp

8/15/2018, 4:56:57 PM

Confirmations

4,046,366

Merkle Root

b8a0e008e7feb1a7e41492974a83cf74dbb605ec54d95a637918a80748664d5a
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.

2.498 × 10⁹⁵(96-digit number)
24985736368141105759…29771377248905516799
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
2.498 × 10⁹⁵(96-digit number)
24985736368141105759…29771377248905516799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.997 × 10⁹⁵(96-digit number)
49971472736282211519…59542754497811033599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
9.994 × 10⁹⁵(96-digit number)
99942945472564423039…19085508995622067199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.998 × 10⁹⁶(97-digit number)
19988589094512884607…38171017991244134399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.997 × 10⁹⁶(97-digit number)
39977178189025769215…76342035982488268799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
7.995 × 10⁹⁶(97-digit number)
79954356378051538431…52684071964976537599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.599 × 10⁹⁷(98-digit number)
15990871275610307686…05368143929953075199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.198 × 10⁹⁷(98-digit number)
31981742551220615372…10736287859906150399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.396 × 10⁹⁷(98-digit number)
63963485102441230745…21472575719812300799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.279 × 10⁹⁸(99-digit number)
12792697020488246149…42945151439624601599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.558 × 10⁹⁸(99-digit number)
25585394040976492298…85890302879249203199
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,978,213 XPM·at block #6,841,728 · 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