Block #1,691,259

2CCLength 10★★☆☆☆

Cunningham Chain of the Second Kind · Discovered 7/27/2016, 11:49:37 AM · Difficulty 10.6892 · 5,139,288 confirmations

2CC
Cunningham Chain of the Second Kind

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

Block Header
Block Hash
ead225fc183dca5852f7234c5512bcd0c52e27c18d1b7b45d36df12a11036a28

Height

#1,691,259

Difficulty

10.689211

Transactions

2

Size

1018 B

Version

2

Bits

0ab07025

Nonce

511,489,489

Timestamp

7/27/2016, 11:49:37 AM

Confirmations

5,139,288

Merkle Root

d45fe2277ca6533d3f7deaa3c98444c8dc601f8af5c17657ac3d7f2879616134
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.

2.652 × 10⁹⁶(97-digit number)
26524991632580666191…59425026549030039041
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
2.652 × 10⁹⁶(97-digit number)
26524991632580666191…59425026549030039041
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
2
2^1 × origin + 1
5.304 × 10⁹⁶(97-digit number)
53049983265161332382…18850053098060078081
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
3
2^2 × origin + 1
1.060 × 10⁹⁷(98-digit number)
10609996653032266476…37700106196120156161
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
4
2^3 × origin + 1
2.121 × 10⁹⁷(98-digit number)
21219993306064532952…75400212392240312321
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
5
2^4 × origin + 1
4.243 × 10⁹⁷(98-digit number)
42439986612129065905…50800424784480624641
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
6
2^5 × origin + 1
8.487 × 10⁹⁷(98-digit number)
84879973224258131811…01600849568961249281
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
7
2^6 × origin + 1
1.697 × 10⁹⁸(99-digit number)
16975994644851626362…03201699137922498561
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
8
2^7 × origin + 1
3.395 × 10⁹⁸(99-digit number)
33951989289703252724…06403398275844997121
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
9
2^8 × origin + 1
6.790 × 10⁹⁸(99-digit number)
67903978579406505449…12806796551689994241
Verify on FactorDB ↗Wolfram Alpha ↗
×2−1 →
10
2^9 × origin + 1
1.358 × 10⁹⁹(100-digit number)
13580795715881301089…25613593103379988481
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,888,533 XPM·at block #6,830,546 · 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