Block #2,257,990

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 8/18/2017, 11:49:06 PM · Difficulty 10.9523 · 4,586,826 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f2c1f5fa3249789a773c0943afb291c943570622bd13a66a6d1e146334d551a8

Height

#2,257,990

Difficulty

10.952279

Transactions

8

Size

2.62 KB

Version

2

Bits

0af3c890

Nonce

821,549,517

Timestamp

8/18/2017, 11:49:06 PM

Confirmations

4,586,826

Merkle Root

9a35dca2e329638e5a6baa5921d14c074eb52fa900fe2a5f8bd053af3b1fb648
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.502 × 10⁹⁶(97-digit number)
65023504091492687122…23803920778391142399
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.502 × 10⁹⁶(97-digit number)
65023504091492687122…23803920778391142399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.300 × 10⁹⁷(98-digit number)
13004700818298537424…47607841556782284799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.600 × 10⁹⁷(98-digit number)
26009401636597074849…95215683113564569599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
5.201 × 10⁹⁷(98-digit number)
52018803273194149698…90431366227129139199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.040 × 10⁹⁸(99-digit number)
10403760654638829939…80862732454258278399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.080 × 10⁹⁸(99-digit number)
20807521309277659879…61725464908516556799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.161 × 10⁹⁸(99-digit number)
41615042618555319758…23450929817033113599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
8.323 × 10⁹⁸(99-digit number)
83230085237110639517…46901859634066227199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.664 × 10⁹⁹(100-digit number)
16646017047422127903…93803719268132454399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.329 × 10⁹⁹(100-digit number)
33292034094844255806…87607438536264908799
Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 10 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
UncommonChain length 10

Roughly 1 in 100 blocks. Solid but expected in a healthy network.

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:58,002,935 XPM·at block #6,844,815 · 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