Block #2,664,667

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/17/2018, 3:37:45 AM · Difficulty 11.6565 · 4,168,265 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b1a2604072f57bc974793276b15f88f2dc0ee5ed22190f299c93b6d18d25a451

Height

#2,664,667

Difficulty

11.656468

Transactions

3

Size

619 B

Version

2

Bits

0ba80e48

Nonce

1,412,360,851

Timestamp

5/17/2018, 3:37:45 AM

Confirmations

4,168,265

Merkle Root

4eabe453dd281b82a54e6029b3564f6f7bc7b2aab02506440b9b9f5941e53007
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.

5.069 × 10⁹⁴(95-digit number)
50691115132555808199…44792319484358391679
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
5.069 × 10⁹⁴(95-digit number)
50691115132555808199…44792319484358391679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.013 × 10⁹⁵(96-digit number)
10138223026511161639…89584638968716783359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.027 × 10⁹⁵(96-digit number)
20276446053022323279…79169277937433566719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.055 × 10⁹⁵(96-digit number)
40552892106044646559…58338555874867133439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.110 × 10⁹⁵(96-digit number)
81105784212089293118…16677111749734266879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.622 × 10⁹⁶(97-digit number)
16221156842417858623…33354223499468533759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.244 × 10⁹⁶(97-digit number)
32442313684835717247…66708446998937067519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.488 × 10⁹⁶(97-digit number)
64884627369671434494…33416893997874135039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.297 × 10⁹⁷(98-digit number)
12976925473934286898…66833787995748270079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.595 × 10⁹⁷(98-digit number)
25953850947868573797…33667575991496540159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.190 × 10⁹⁷(98-digit number)
51907701895737147595…67335151982993080319
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,907,632 XPM·at block #6,832,931 · 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