Block #1,596,909

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/23/2016, 5:06:27 PM · Difficulty 10.6114 · 5,227,928 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
417dab484cc8b4a2a544bf3848076392a2e5b537bfc44899594a26dd509157c7

Height

#1,596,909

Difficulty

10.611351

Transactions

2

Size

1.28 KB

Version

2

Bits

0a9c817f

Nonce

1,192,643,306

Timestamp

5/23/2016, 5:06:27 PM

Confirmations

5,227,928

Merkle Root

1a3a7336914398507ecfc165cd5566de33c2d242be7a99b8f214b995983c0b54
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.322 × 10⁹⁴(95-digit number)
63222566905890975368…07740555096842383041
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.322 × 10⁹⁴(95-digit number)
63222566905890975368…07740555096842383041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
1.264 × 10⁹⁵(96-digit number)
12644513381178195073…15481110193684766081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
2.528 × 10⁹⁵(96-digit number)
25289026762356390147…30962220387369532161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
5.057 × 10⁹⁵(96-digit number)
50578053524712780295…61924440774739064321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
1.011 × 10⁹⁶(97-digit number)
10115610704942556059…23848881549478128641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
2.023 × 10⁹⁶(97-digit number)
20231221409885112118…47697763098956257281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
4.046 × 10⁹⁶(97-digit number)
40462442819770224236…95395526197912514561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
8.092 × 10⁹⁶(97-digit number)
80924885639540448472…90791052395825029121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
1.618 × 10⁹⁷(98-digit number)
16184977127908089694…81582104791650058241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
3.236 × 10⁹⁷(98-digit number)
32369954255816179388…63164209583300116481
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,776 XPM·at block #6,824,836 · 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