Block #2,558,283

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 3/10/2018, 6:34:24 AM · Difficulty 10.9916 · 4,278,739 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2f8f1515f89162e4bd2a3a58f1c564fedc6f0b43a4a65564efac300fdf6d02e8

Height

#2,558,283

Difficulty

10.991629

Transactions

2

Size

872 B

Version

2

Bits

0afddb6e

Nonce

628,785,559

Timestamp

3/10/2018, 6:34:24 AM

Confirmations

4,278,739

Merkle Root

32e13a25cbd0a19704f7005772f2af3dffa00dcd074fd131fbdf65aa960eaf58
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.

5.026 × 10⁹⁶(97-digit number)
50265990960383142960…42954346485216686079
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
5.026 × 10⁹⁶(97-digit number)
50265990960383142960…42954346485216686079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.005 × 10⁹⁷(98-digit number)
10053198192076628592…85908692970433372159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.010 × 10⁹⁷(98-digit number)
20106396384153257184…71817385940866744319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.021 × 10⁹⁷(98-digit number)
40212792768306514368…43634771881733488639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.042 × 10⁹⁷(98-digit number)
80425585536613028736…87269543763466977279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.608 × 10⁹⁸(99-digit number)
16085117107322605747…74539087526933954559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.217 × 10⁹⁸(99-digit number)
32170234214645211494…49078175053867909119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.434 × 10⁹⁸(99-digit number)
64340468429290422989…98156350107735818239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.286 × 10⁹⁹(100-digit number)
12868093685858084597…96312700215471636479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.573 × 10⁹⁹(100-digit number)
25736187371716169195…92625400430943272959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
5.147 × 10⁹⁹(100-digit number)
51472374743432338391…85250800861886545919
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,940,474 XPM·at block #6,837,021 · 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