Block #2,653,405

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/8/2018, 9:07:45 AM · Difficulty 11.7378 · 4,177,319 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
bb975322adbff7b5e9eaf061e98208acb77e27e9b5ff516cfa02588641a71acc

Height

#2,653,405

Difficulty

11.737793

Transactions

2

Size

427 B

Version

2

Bits

0bbcdffa

Nonce

861,951,672

Timestamp

5/8/2018, 9:07:45 AM

Confirmations

4,177,319

Merkle Root

bab68f492c83bc3b51a9862ccfe8a0c9626bc6158f86d3adee67921009fb6555
Transactions (2)
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.

6.558 × 10⁹⁴(95-digit number)
65587860678057186682…51167397426888306799
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
6.558 × 10⁹⁴(95-digit number)
65587860678057186682…51167397426888306799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.311 × 10⁹⁵(96-digit number)
13117572135611437336…02334794853776613599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.623 × 10⁹⁵(96-digit number)
26235144271222874672…04669589707553227199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.247 × 10⁹⁵(96-digit number)
52470288542445749345…09339179415106454399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.049 × 10⁹⁶(97-digit number)
10494057708489149869…18678358830212908799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.098 × 10⁹⁶(97-digit number)
20988115416978299738…37356717660425817599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.197 × 10⁹⁶(97-digit number)
41976230833956599476…74713435320851635199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.395 × 10⁹⁶(97-digit number)
83952461667913198953…49426870641703270399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.679 × 10⁹⁷(98-digit number)
16790492333582639790…98853741283406540799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.358 × 10⁹⁷(98-digit number)
33580984667165279581…97707482566813081599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.716 × 10⁹⁷(98-digit number)
67161969334330559162…95414965133626163199
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,889,927 XPM·at block #6,830,723 · 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