Block #1,686,578

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/23/2016, 10:53:19 PM · Difficulty 10.7136 · 5,123,529 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8b2b6ad918827aecc6b12261bdd19dc5222882132ab4abd097d3887fba398d80

Height

#1,686,578

Difficulty

10.713567

Transactions

6

Size

9.40 KB

Version

2

Bits

0ab6ac59

Nonce

1,271,933,604

Timestamp

7/23/2016, 10:53:19 PM

Confirmations

5,123,529

Merkle Root

00e730c686a3884475041ce419d25ff31c4fb1d696f1945d294944950af00402
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.

3.290 × 10⁹⁴(95-digit number)
32901717614336162000…17919811073542118399
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
3.290 × 10⁹⁴(95-digit number)
32901717614336162000…17919811073542118399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.580 × 10⁹⁴(95-digit number)
65803435228672324000…35839622147084236799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.316 × 10⁹⁵(96-digit number)
13160687045734464800…71679244294168473599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.632 × 10⁹⁵(96-digit number)
26321374091468929600…43358488588336947199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.264 × 10⁹⁵(96-digit number)
52642748182937859200…86716977176673894399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.052 × 10⁹⁶(97-digit number)
10528549636587571840…73433954353347788799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.105 × 10⁹⁶(97-digit number)
21057099273175143680…46867908706695577599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.211 × 10⁹⁶(97-digit number)
42114198546350287360…93735817413391155199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.422 × 10⁹⁶(97-digit number)
84228397092700574720…87471634826782310399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.684 × 10⁹⁷(98-digit number)
16845679418540114944…74943269653564620799
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,724,926 XPM·at block #6,810,106 · 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.

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