Block #2,650,788

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/6/2018, 8:04:02 AM · Difficulty 11.7542 · 4,191,642 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
18c325cb5d0ad668b61c8ed041079822f732623d4baf6467f7d7917281c1ee1e

Height

#2,650,788

Difficulty

11.754160

Transactions

3

Size

652 B

Version

2

Bits

0bc11099

Nonce

23,416,319

Timestamp

5/6/2018, 8:04:02 AM

Confirmations

4,191,642

Merkle Root

4682808348d0040c30371cbfcccb7c5bef00e75558970da396f5122a61f63855
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.186 × 10⁹⁶(97-digit number)
21863593577760509111…83381349278561228799
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.186 × 10⁹⁶(97-digit number)
21863593577760509111…83381349278561228799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
4.372 × 10⁹⁶(97-digit number)
43727187155521018223…66762698557122457599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
8.745 × 10⁹⁶(97-digit number)
87454374311042036446…33525397114244915199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.749 × 10⁹⁷(98-digit number)
17490874862208407289…67050794228489830399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.498 × 10⁹⁷(98-digit number)
34981749724416814578…34101588456979660799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.996 × 10⁹⁷(98-digit number)
69963499448833629157…68203176913959321599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.399 × 10⁹⁸(99-digit number)
13992699889766725831…36406353827918643199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.798 × 10⁹⁸(99-digit number)
27985399779533451662…72812707655837286399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
5.597 × 10⁹⁸(99-digit number)
55970799559066903325…45625415311674572799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.119 × 10⁹⁹(100-digit number)
11194159911813380665…91250830623349145599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.238 × 10⁹⁹(100-digit number)
22388319823626761330…82501661246698291199
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,983,855 XPM·at block #6,842,429 · 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