Block #2,660,464

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/14/2018, 10:34:03 AM · Difficulty 11.6353 · 4,181,662 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
610cd867e705be8b0b207f371f576b0a1d751552b5a0e422dbe953347639cff7

Height

#2,660,464

Difficulty

11.635258

Transactions

5

Size

2.06 KB

Version

2

Bits

0ba2a03e

Nonce

1,741,953,401

Timestamp

5/14/2018, 10:34:03 AM

Confirmations

4,181,662

Merkle Root

17d1be8ce7c191c8cf0b1cdc7082e882a45fa5def7627842f867a33bca602cc5
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.

7.676 × 10⁹⁴(95-digit number)
76762985189795260797…01357521572334569439
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
7.676 × 10⁹⁴(95-digit number)
76762985189795260797…01357521572334569439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.535 × 10⁹⁵(96-digit number)
15352597037959052159…02715043144669138879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.070 × 10⁹⁵(96-digit number)
30705194075918104318…05430086289338277759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.141 × 10⁹⁵(96-digit number)
61410388151836208637…10860172578676555519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.228 × 10⁹⁶(97-digit number)
12282077630367241727…21720345157353111039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.456 × 10⁹⁶(97-digit number)
24564155260734483455…43440690314706222079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.912 × 10⁹⁶(97-digit number)
49128310521468966910…86881380629412444159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.825 × 10⁹⁶(97-digit number)
98256621042937933820…73762761258824888319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.965 × 10⁹⁷(98-digit number)
19651324208587586764…47525522517649776639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.930 × 10⁹⁷(98-digit number)
39302648417175173528…95051045035299553279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
7.860 × 10⁹⁷(98-digit number)
78605296834350347056…90102090070599106559
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,981,396 XPM·at block #6,842,125 · 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