Block #1,982,322

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/13/2017, 11:09:43 PM · Difficulty 10.7529 · 4,835,419 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
962fefc8c1b468a13fab5b2ce7886b288a214b5158991dd474231708a22a52c7

Height

#1,982,322

Difficulty

10.752850

Transactions

2

Size

3.47 KB

Version

2

Bits

0ac0bace

Nonce

1,530,514,757

Timestamp

2/13/2017, 11:09:43 PM

Confirmations

4,835,419

Merkle Root

35da5d1e1c9fce515102aa4094ed52f5b913218fc5ca95e6e5d21dff87895986
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.

1.786 × 10⁹⁴(95-digit number)
17862271299537072738…17627248443313146881
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
1.786 × 10⁹⁴(95-digit number)
17862271299537072738…17627248443313146881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.572 × 10⁹⁴(95-digit number)
35724542599074145476…35254496886626293761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.144 × 10⁹⁴(95-digit number)
71449085198148290952…70508993773252587521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.428 × 10⁹⁵(96-digit number)
14289817039629658190…41017987546505175041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.857 × 10⁹⁵(96-digit number)
28579634079259316381…82035975093010350081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
5.715 × 10⁹⁵(96-digit number)
57159268158518632762…64071950186020700161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.143 × 10⁹⁶(97-digit number)
11431853631703726552…28143900372041400321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.286 × 10⁹⁶(97-digit number)
22863707263407453104…56287800744082800641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
4.572 × 10⁹⁶(97-digit number)
45727414526814906209…12575601488165601281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
9.145 × 10⁹⁶(97-digit number)
91454829053629812419…25151202976331202561
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,785,982 XPM·at block #6,817,740 · 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