Block #2,138,249

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/30/2017, 5:37:06 PM · Difficulty 10.8844 · 4,686,940 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
322a233b1efe4ea55048904ae9dc2cedfec65877eeec09f3bb3758f0887ecb25

Height

#2,138,249

Difficulty

10.884370

Transactions

2

Size

4.90 KB

Version

2

Bits

0ae26614

Nonce

1,273,648,870

Timestamp

5/30/2017, 5:37:06 PM

Confirmations

4,686,940

Merkle Root

1aee48fa1f13479fbf3cc889c64ed26df7416371ee7820fb957125930b72612a
Transactions (2)
1 in → 1 out8.4900 XPM109 B
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.583 × 10⁹⁵(96-digit number)
25832985724173307433…02028917636177930239
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.583 × 10⁹⁵(96-digit number)
25832985724173307433…02028917636177930239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
5.166 × 10⁹⁵(96-digit number)
51665971448346614866…04057835272355860479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.033 × 10⁹⁶(97-digit number)
10333194289669322973…08115670544711720959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.066 × 10⁹⁶(97-digit number)
20666388579338645946…16231341089423441919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
4.133 × 10⁹⁶(97-digit number)
41332777158677291893…32462682178846883839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
8.266 × 10⁹⁶(97-digit number)
82665554317354583786…64925364357693767679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.653 × 10⁹⁷(98-digit number)
16533110863470916757…29850728715387535359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
3.306 × 10⁹⁷(98-digit number)
33066221726941833514…59701457430775070719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
6.613 × 10⁹⁷(98-digit number)
66132443453883667029…19402914861550141439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.322 × 10⁹⁸(99-digit number)
13226488690776733405…38805829723100282879
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,845,603 XPM·at block #6,825,188 · 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