Block #2,598,773

1CCLength 11★★★☆☆

Cunningham Chain of the First Kind · Discovered 4/3/2018, 6:06:11 PM · Difficulty 11.3218 · 4,232,221 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4784a39a73e08f1b25bf0dceba32b3ea59fbd72d0b973606e868a77e7e0e8298

Height

#2,598,773

Difficulty

11.321823

Transactions

2

Size

1.72 KB

Version

2

Bits

0b5262fd

Nonce

383,795,039

Timestamp

4/3/2018, 6:06:11 PM

Confirmations

4,232,221

Merkle Root

59ab826b54881889fe83f8d78b7252defa1d128d31fe1bc30d460c352c0d7305
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.

2.545 × 10⁹⁶(97-digit number)
25452400876746783787…22935337415947566079
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
2.545 × 10⁹⁶(97-digit number)
25452400876746783787…22935337415947566079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.090 × 10⁹⁶(97-digit number)
50904801753493567575…45870674831895132159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.018 × 10⁹⁷(98-digit number)
10180960350698713515…91741349663790264319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.036 × 10⁹⁷(98-digit number)
20361920701397427030…83482699327580528639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.072 × 10⁹⁷(98-digit number)
40723841402794854060…66965398655161057279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.144 × 10⁹⁷(98-digit number)
81447682805589708120…33930797310322114559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.628 × 10⁹⁸(99-digit number)
16289536561117941624…67861594620644229119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.257 × 10⁹⁸(99-digit number)
32579073122235883248…35723189241288458239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.515 × 10⁹⁸(99-digit number)
65158146244471766496…71446378482576916479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.303 × 10⁹⁹(100-digit number)
13031629248894353299…42892756965153832959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
11
2^10 × origin − 1
2.606 × 10⁹⁹(100-digit number)
26063258497788706598…85785513930307665919
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,892,093 XPM·at block #6,830,993 · 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