Block #2,654,806

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/9/2018, 3:44:56 PM · Difficulty 11.7142 · 4,178,833 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
97e05950d55e00e33553e3242441369fd5d5d7619ac163a9435a7d1444565c83

Height

#2,654,806

Difficulty

11.714170

Transactions

3

Size

1.36 KB

Version

2

Bits

0bb6d3d6

Nonce

129,191,754

Timestamp

5/9/2018, 3:44:56 PM

Confirmations

4,178,833

Merkle Root

0af26d7524172cb821d362a7f9d16880b2ad876f78858a60e1d9b0cf8279544b
Transactions (3)
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.379 × 10⁹⁵(96-digit number)
33792930888289762635…24987576453915155199
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.379 × 10⁹⁵(96-digit number)
33792930888289762635…24987576453915155199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.758 × 10⁹⁵(96-digit number)
67585861776579525270…49975152907830310399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.351 × 10⁹⁶(97-digit number)
13517172355315905054…99950305815660620799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.703 × 10⁹⁶(97-digit number)
27034344710631810108…99900611631321241599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.406 × 10⁹⁶(97-digit number)
54068689421263620216…99801223262642483199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.081 × 10⁹⁷(98-digit number)
10813737884252724043…99602446525284966399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.162 × 10⁹⁷(98-digit number)
21627475768505448086…99204893050569932799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.325 × 10⁹⁷(98-digit number)
43254951537010896172…98409786101139865599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.650 × 10⁹⁷(98-digit number)
86509903074021792345…96819572202279731199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.730 × 10⁹⁸(99-digit number)
17301980614804358469…93639144404559462399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
3.460 × 10⁹⁸(99-digit number)
34603961229608716938…87278288809118924799
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,913,324 XPM·at block #6,833,638 · 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