Block #1,609,819

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 6/1/2016, 4:10:55 PM · Difficulty 10.6122 · 5,222,919 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
90d5ac08da6c734ff73661ae2698e25ba1783cef93684323b8830a9ea79ebf84

Height

#1,609,819

Difficulty

10.612204

Transactions

17

Size

8.25 KB

Version

2

Bits

0a9cb964

Nonce

352,320,096

Timestamp

6/1/2016, 4:10:55 PM

Confirmations

5,222,919

Merkle Root

ae2f89e6b4fb1ece280550ffe35804a93fcaea70aced3e4dc1c993256facc707
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.997 × 10⁹⁵(96-digit number)
19977918187429500926…60845076590018226241
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.997 × 10⁹⁵(96-digit number)
19977918187429500926…60845076590018226241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
3.995 × 10⁹⁵(96-digit number)
39955836374859001852…21690153180036452481
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
7.991 × 10⁹⁵(96-digit number)
79911672749718003705…43380306360072904961
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.598 × 10⁹⁶(97-digit number)
15982334549943600741…86760612720145809921
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
3.196 × 10⁹⁶(97-digit number)
31964669099887201482…73521225440291619841
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
6.392 × 10⁹⁶(97-digit number)
63929338199774402964…47042450880583239681
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.278 × 10⁹⁷(98-digit number)
12785867639954880592…94084901761166479361
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
2.557 × 10⁹⁷(98-digit number)
25571735279909761185…88169803522332958721
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
5.114 × 10⁹⁷(98-digit number)
51143470559819522371…76339607044665917441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.022 × 10⁹⁸(99-digit number)
10228694111963904474…52679214089331834881
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,906,063 XPM·at block #6,832,737 · 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