Block #1,593,341

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 5/21/2016, 12:04:42 AM · Difficulty 10.6362 · 5,249,084 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
8fb2d5940df2a81f416701dea064a07862c91abfbb5c0f92b8c1722c2ea70dc3

Height

#1,593,341

Difficulty

10.636156

Transactions

30

Size

11.57 KB

Version

2

Bits

0aa2db25

Nonce

1,446,183,355

Timestamp

5/21/2016, 12:04:42 AM

Confirmations

5,249,084

Merkle Root

e7d3f2657db5dd10f916be4df8d1e626e323bbd31f4dfb8cdeb53007f9214c77
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.489 × 10⁹⁷(98-digit number)
14892146204393515618…25481493859793469441
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.489 × 10⁹⁷(98-digit number)
14892146204393515618…25481493859793469441
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
2.978 × 10⁹⁷(98-digit number)
29784292408787031236…50962987719586938881
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
5.956 × 10⁹⁷(98-digit number)
59568584817574062473…01925975439173877761
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
1.191 × 10⁹⁸(99-digit number)
11913716963514812494…03851950878347755521
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
2.382 × 10⁹⁸(99-digit number)
23827433927029624989…07703901756695511041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
4.765 × 10⁹⁸(99-digit number)
47654867854059249978…15407803513391022081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
9.530 × 10⁹⁸(99-digit number)
95309735708118499956…30815607026782044161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
1.906 × 10⁹⁹(100-digit number)
19061947141623699991…61631214053564088321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
3.812 × 10⁹⁹(100-digit number)
38123894283247399982…23262428107128176641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
7.624 × 10⁹⁹(100-digit number)
76247788566494799965…46524856214256353281
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,983,815 XPM·at block #6,842,424 · 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