Block #1,597,665

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/24/2016, 6:10:03 AM · Difficulty 10.6093 · 5,227,173 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
780d1aa0ea8a50e5fedd83a10374014b066efc605a6b792c73369f5b97d8febe

Height

#1,597,665

Difficulty

10.609313

Transactions

2

Size

1005 B

Version

2

Bits

0a9bfbef

Nonce

809,107,380

Timestamp

5/24/2016, 6:10:03 AM

Confirmations

5,227,173

Merkle Root

cd63ece128845aa70c2f47818cf2ccf497c94148f6afc872206c0e30e046ab1f
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.265 × 10⁹⁴(95-digit number)
62652128822815829878…89090824488479126481
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.265 × 10⁹⁴(95-digit number)
62652128822815829878…89090824488479126481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.253 × 10⁹⁵(96-digit number)
12530425764563165975…78181648976958252961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.506 × 10⁹⁵(96-digit number)
25060851529126331951…56363297953916505921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.012 × 10⁹⁵(96-digit number)
50121703058252663903…12726595907833011841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.002 × 10⁹⁶(97-digit number)
10024340611650532780…25453191815666023681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.004 × 10⁹⁶(97-digit number)
20048681223301065561…50906383631332047361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.009 × 10⁹⁶(97-digit number)
40097362446602131122…01812767262664094721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.019 × 10⁹⁶(97-digit number)
80194724893204262244…03625534525328189441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.603 × 10⁹⁷(98-digit number)
16038944978640852448…07251069050656378881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.207 × 10⁹⁷(98-digit number)
32077889957281704897…14502138101312757761
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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …
Circulating Supply:57,842,784 XPM·at block #6,824,837 · 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