Block #2,163,425

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/16/2017, 5:47:32 PM · Difficulty 10.8999 · 4,653,203 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
f82c3fc94516197c4dc1748bb0e3335a35718ca665ae6a538eaea27d6e068e1f

Height

#2,163,425

Difficulty

10.899872

Transactions

6

Size

8.06 KB

Version

2

Bits

0ae65e0a

Nonce

1,158,783,452

Timestamp

6/16/2017, 5:47:32 PM

Confirmations

4,653,203

Merkle Root

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

8.783 × 10⁹⁶(97-digit number)
87833306619277493678…73291353135662484479
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
8.783 × 10⁹⁶(97-digit number)
87833306619277493678…73291353135662484479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.756 × 10⁹⁷(98-digit number)
17566661323855498735…46582706271324968959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.513 × 10⁹⁷(98-digit number)
35133322647710997471…93165412542649937919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.026 × 10⁹⁷(98-digit number)
70266645295421994942…86330825085299875839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.405 × 10⁹⁸(99-digit number)
14053329059084398988…72661650170599751679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.810 × 10⁹⁸(99-digit number)
28106658118168797977…45323300341199503359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.621 × 10⁹⁸(99-digit number)
56213316236337595954…90646600682399006719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.124 × 10⁹⁹(100-digit number)
11242663247267519190…81293201364798013439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.248 × 10⁹⁹(100-digit number)
22485326494535038381…62586402729596026879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.497 × 10⁹⁹(100-digit number)
44970652989070076763…25172805459192053759
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,777,145 XPM·at block #6,816,627 · 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