Block #2,641,325

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/1/2018, 7:41:07 AM · Difficulty 11.6162 · 4,198,027 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c75e5dc14203976e93cb01f52b13e8ec16f0033c01eced96d9995528cad1d1d5

Height

#2,641,325

Difficulty

11.616228

Transactions

64

Size

20.16 KB

Version

2

Bits

0b9dc120

Nonce

346,381,852

Timestamp

5/1/2018, 7:41:07 AM

Confirmations

4,198,027

Merkle Root

574090fe15a3af7e2638329487a1eb09fe2533c0da5c9f0aea7ba137cb35bdf1
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.

1.068 × 10⁹³(94-digit number)
10680214222845601541…24546577916083381489
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
1.068 × 10⁹³(94-digit number)
10680214222845601541…24546577916083381489
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.136 × 10⁹³(94-digit number)
21360428445691203083…49093155832166762979
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
4.272 × 10⁹³(94-digit number)
42720856891382406166…98186311664333525959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
8.544 × 10⁹³(94-digit number)
85441713782764812332…96372623328667051919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.708 × 10⁹⁴(95-digit number)
17088342756552962466…92745246657334103839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
3.417 × 10⁹⁴(95-digit number)
34176685513105924933…85490493314668207679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
6.835 × 10⁹⁴(95-digit number)
68353371026211849866…70980986629336415359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.367 × 10⁹⁵(96-digit number)
13670674205242369973…41961973258672830719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.734 × 10⁹⁵(96-digit number)
27341348410484739946…83923946517345661439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
5.468 × 10⁹⁵(96-digit number)
54682696820969479892…67847893034691322879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.093 × 10⁹⁶(97-digit number)
10936539364193895978…35695786069382645759
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,959,102 XPM·at block #6,839,351 · 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