Block #2,654,271

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 5/9/2018, 4:10:08 AM · Difficulty 11.7231 · 4,187,266 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f6542ea9a7a8c49273b0ac2868a665eae61c06e511d059d2f9517fba9a21930d

Height

#2,654,271

Difficulty

11.723070

Transactions

3

Size

10.31 KB

Version

2

Bits

0bb91b19

Nonce

66,435,343

Timestamp

5/9/2018, 4:10:08 AM

Confirmations

4,187,266

Merkle Root

161af0ace0d617189173e1b12079b810a2fbb179f28ae87579b60d556127c39d
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.

1.672 × 10⁹⁷(98-digit number)
16724698083931009689…80045272398620757759
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.672 × 10⁹⁷(98-digit number)
16724698083931009689…80045272398620757759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.344 × 10⁹⁷(98-digit number)
33449396167862019378…60090544797241515519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.689 × 10⁹⁷(98-digit number)
66898792335724038757…20181089594483031039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.337 × 10⁹⁸(99-digit number)
13379758467144807751…40362179188966062079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.675 × 10⁹⁸(99-digit number)
26759516934289615503…80724358377932124159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.351 × 10⁹⁸(99-digit number)
53519033868579231006…61448716755864248319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.070 × 10⁹⁹(100-digit number)
10703806773715846201…22897433511728496639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.140 × 10⁹⁹(100-digit number)
21407613547431692402…45794867023456993279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.281 × 10⁹⁹(100-digit number)
42815227094863384804…91589734046913986559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.563 × 10⁹⁹(100-digit number)
85630454189726769609…83179468093827973119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
1.712 × 10¹⁰⁰(101-digit number)
17126090837945353921…66358936187655946239
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,976,679 XPM·at block #6,841,536 · 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