Block #1,691,291

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/27/2016, 12:21:04 PM · Difficulty 10.6891 · 5,139,170 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
2c18789bf8fee8d23bea31693df226efccca63ad0544021027f27e63e8565564

Height

#1,691,291

Difficulty

10.689149

Transactions

2

Size

1015 B

Version

2

Bits

0ab06c0a

Nonce

970,743,712

Timestamp

7/27/2016, 12:21:04 PM

Confirmations

5,139,170

Merkle Root

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

8.159 × 10⁹⁵(96-digit number)
81598998829196429442…39355400633011551999
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
8.159 × 10⁹⁵(96-digit number)
81598998829196429442…39355400633011551999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.631 × 10⁹⁶(97-digit number)
16319799765839285888…78710801266023103999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.263 × 10⁹⁶(97-digit number)
32639599531678571777…57421602532046207999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.527 × 10⁹⁶(97-digit number)
65279199063357143554…14843205064092415999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.305 × 10⁹⁷(98-digit number)
13055839812671428710…29686410128184831999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.611 × 10⁹⁷(98-digit number)
26111679625342857421…59372820256369663999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.222 × 10⁹⁷(98-digit number)
52223359250685714843…18745640512739327999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.044 × 10⁹⁸(99-digit number)
10444671850137142968…37491281025478655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.088 × 10⁹⁸(99-digit number)
20889343700274285937…74982562050957311999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.177 × 10⁹⁸(99-digit number)
41778687400548571874…49965124101914623999
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 First 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 1CC formula:

1CC: p₁ (first prime), p₂ = 2p₁ + 1, p₃ = 2p₂ + 1, …
Circulating Supply:57,887,935 XPM·at block #6,830,460 · 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