Block #1,688,601

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/25/2016, 10:12:12 AM · Difficulty 10.7083 · 5,136,413 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
a9e805e6668b239018a876155591c1c0fdec6a0e5bae9d505d522c26d68d9d2d

Height

#1,688,601

Difficulty

10.708344

Transactions

2

Size

7.64 KB

Version

2

Bits

0ab5560c

Nonce

190,798,902

Timestamp

7/25/2016, 10:12:12 AM

Confirmations

5,136,413

Merkle Root

15a934a8e73ff4280a1dac46da0dc368812f17b7e01bfa33575d333ee835848e
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.

9.025 × 10⁹⁵(96-digit number)
90257324193258992274…71054723822016243199
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
9.025 × 10⁹⁵(96-digit number)
90257324193258992274…71054723822016243199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.805 × 10⁹⁶(97-digit number)
18051464838651798454…42109447644032486399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.610 × 10⁹⁶(97-digit number)
36102929677303596909…84218895288064972799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
7.220 × 10⁹⁶(97-digit number)
72205859354607193819…68437790576129945599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.444 × 10⁹⁷(98-digit number)
14441171870921438763…36875581152259891199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.888 × 10⁹⁷(98-digit number)
28882343741842877527…73751162304519782399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
5.776 × 10⁹⁷(98-digit number)
57764687483685755055…47502324609039564799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.155 × 10⁹⁸(99-digit number)
11552937496737151011…95004649218079129599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
2.310 × 10⁹⁸(99-digit number)
23105874993474302022…90009298436158259199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
4.621 × 10⁹⁸(99-digit number)
46211749986948604044…80018596872316518399
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,844,197 XPM·at block #6,825,013 · 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