Block #1,897,968

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 12/17/2016, 7:55:58 AM · Difficulty 10.7535 · 4,935,764 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
6758fdccdc86ace35d0a5109805bcddd7dba08d8d5d10c1561bb957663594ef3

Height

#1,897,968

Difficulty

10.753499

Transactions

2

Size

1.14 KB

Version

2

Bits

0ac0e54d

Nonce

2,109,610,441

Timestamp

12/17/2016, 7:55:58 AM

Confirmations

4,935,764

Merkle Root

330640f3eeb73a3261d4b6edd7801f6594565939e74b818966ba4a65a44c7fae
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.

4.541 × 10⁹⁷(98-digit number)
45414689742929885706…70080640785965291521
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
4.541 × 10⁹⁷(98-digit number)
45414689742929885706…70080640785965291521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
9.082 × 10⁹⁷(98-digit number)
90829379485859771412…40161281571930583041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.816 × 10⁹⁸(99-digit number)
18165875897171954282…80322563143861166081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
3.633 × 10⁹⁸(99-digit number)
36331751794343908564…60645126287722332161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
7.266 × 10⁹⁸(99-digit number)
72663503588687817129…21290252575444664321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
1.453 × 10⁹⁹(100-digit number)
14532700717737563425…42580505150889328641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
2.906 × 10⁹⁹(100-digit number)
29065401435475126851…85161010301778657281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
5.813 × 10⁹⁹(100-digit number)
58130802870950253703…70322020603557314561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.162 × 10¹⁰⁰(101-digit number)
11626160574190050740…40644041207114629121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
2.325 × 10¹⁰⁰(101-digit number)
23252321148380101481…81288082414229258241
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,914,079 XPM·at block #6,833,731 · 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