Block #2,558,320

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/10/2018, 7:17:42 AM · Difficulty 10.9916 · 4,272,974 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
ba8de2b48dbbf0a04f9fef6cb66e4f286ca9ac6a1482c7762ff74a9f0449bc03

Height

#2,558,320

Difficulty

10.991627

Transactions

3

Size

946 B

Version

2

Bits

0afddb42

Nonce

575,825,080

Timestamp

3/10/2018, 7:17:42 AM

Confirmations

4,272,974

Merkle Root

868bd5b8a15b4864e8e0047606a56dd802d8e9811e52d8cf20998ad5decec252
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.603 × 10⁹¹(92-digit number)
66030321062154824855…06681638469175047189
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.603 × 10⁹¹(92-digit number)
66030321062154824855…06681638469175047189
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.320 × 10⁹²(93-digit number)
13206064212430964971…13363276938350094379
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.641 × 10⁹²(93-digit number)
26412128424861929942…26726553876700188759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.282 × 10⁹²(93-digit number)
52824256849723859884…53453107753400377519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.056 × 10⁹³(94-digit number)
10564851369944771976…06906215506800755039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.112 × 10⁹³(94-digit number)
21129702739889543953…13812431013601510079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.225 × 10⁹³(94-digit number)
42259405479779087907…27624862027203020159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.451 × 10⁹³(94-digit number)
84518810959558175814…55249724054406040319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.690 × 10⁹⁴(95-digit number)
16903762191911635162…10499448108812080639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.380 × 10⁹⁴(95-digit number)
33807524383823270325…20998896217624161279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
6.761 × 10⁹⁴(95-digit number)
67615048767646540651…41997792435248322559
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,894,499 XPM·at block #6,831,293 · 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