Block #2,100,498

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/5/2017, 6:06:02 AM · Difficulty 10.8555 · 4,736,433 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9849f6a719cb1d32d72934fce804618fd3b3deb010c332bdb9afb7af14584e51

Height

#2,100,498

Difficulty

10.855508

Transactions

3

Size

798 B

Version

2

Bits

0adb0291

Nonce

350,523,925

Timestamp

5/5/2017, 6:06:02 AM

Confirmations

4,736,433

Merkle Root

b769b40282863db170b2171b464fbfe80daf708ac9bd3f2f0115bbfdbaf60309
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.

4.130 × 10⁹⁴(95-digit number)
41304103603819268052…65462135103401823239
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
4.130 × 10⁹⁴(95-digit number)
41304103603819268052…65462135103401823239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.260 × 10⁹⁴(95-digit number)
82608207207638536104…30924270206803646479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.652 × 10⁹⁵(96-digit number)
16521641441527707220…61848540413607292959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.304 × 10⁹⁵(96-digit number)
33043282883055414441…23697080827214585919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
6.608 × 10⁹⁵(96-digit number)
66086565766110828883…47394161654429171839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.321 × 10⁹⁶(97-digit number)
13217313153222165776…94788323308858343679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.643 × 10⁹⁶(97-digit number)
26434626306444331553…89576646617716687359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.286 × 10⁹⁶(97-digit number)
52869252612888663107…79153293235433374719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.057 × 10⁹⁷(98-digit number)
10573850522577732621…58306586470866749439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.114 × 10⁹⁷(98-digit number)
21147701045155465242…16613172941733498879
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:57,939,745 XPM·at block #6,836,930 · 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