Block #1,981,537

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 2/13/2017, 9:47:26 AM · Difficulty 10.7536 · 4,849,646 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
d520a4ad00173a1ff17ecba4e959be90c2dca5062c7163a92f60bc306faca26d

Height

#1,981,537

Difficulty

10.753610

Transactions

2

Size

1.14 KB

Version

2

Bits

0ac0ec8f

Nonce

1,923,680,030

Timestamp

2/13/2017, 9:47:26 AM

Confirmations

4,849,646

Merkle Root

ff531afd3a69e969d4acbd17e981d6cc6f4d946d3a8dc51d063fb73de44ca279
Transactions (2)
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.262 × 10⁹⁶(97-digit number)
12628749502383758675…31418071419924234241
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.262 × 10⁹⁶(97-digit number)
12628749502383758675…31418071419924234241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.525 × 10⁹⁶(97-digit number)
25257499004767517351…62836142839848468481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.051 × 10⁹⁶(97-digit number)
50514998009535034702…25672285679696936961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.010 × 10⁹⁷(98-digit number)
10102999601907006940…51344571359393873921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.020 × 10⁹⁷(98-digit number)
20205999203814013880…02689142718787747841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.041 × 10⁹⁷(98-digit number)
40411998407628027761…05378285437575495681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
8.082 × 10⁹⁷(98-digit number)
80823996815256055523…10756570875150991361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.616 × 10⁹⁸(99-digit number)
16164799363051211104…21513141750301982721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.232 × 10⁹⁸(99-digit number)
32329598726102422209…43026283500603965441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
6.465 × 10⁹⁸(99-digit number)
64659197452204844419…86052567001207930881
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,893,607 XPM·at block #6,831,182 · 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