Block #2,788,876

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 8/11/2018, 6:53:10 AM · Difficulty 11.6723 · 4,051,390 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
386e59240814f233f2cf18eedb2539cd0437293c102dc688f20596e03f4c0b41

Height

#2,788,876

Difficulty

11.672272

Transactions

12

Size

4.14 KB

Version

2

Bits

0bac1a08

Nonce

1,279,709,422

Timestamp

8/11/2018, 6:53:10 AM

Confirmations

4,051,390

Merkle Root

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

3.443 × 10⁹³(94-digit number)
34437513967258542149…98670500543396989159
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
3.443 × 10⁹³(94-digit number)
34437513967258542149…98670500543396989159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.887 × 10⁹³(94-digit number)
68875027934517084299…97341001086793978319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.377 × 10⁹⁴(95-digit number)
13775005586903416859…94682002173587956639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.755 × 10⁹⁴(95-digit number)
27550011173806833719…89364004347175913279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.510 × 10⁹⁴(95-digit number)
55100022347613667439…78728008694351826559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.102 × 10⁹⁵(96-digit number)
11020004469522733487…57456017388703653119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.204 × 10⁹⁵(96-digit number)
22040008939045466975…14912034777407306239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.408 × 10⁹⁵(96-digit number)
44080017878090933951…29824069554814612479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.816 × 10⁹⁵(96-digit number)
88160035756181867903…59648139109629224959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.763 × 10⁹⁶(97-digit number)
17632007151236373580…19296278219258449919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.526 × 10⁹⁶(97-digit number)
35264014302472747161…38592556438516899839
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,966,442 XPM·at block #6,840,265 · 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