Block #1,776,329

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/23/2016, 4:26:57 PM · Difficulty 10.7609 · 5,033,772 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
9aaeb9e54a8a4a87c8f8c77ce21c6263e24d78cbe0d71298111faf0cdb1a525a

Height

#1,776,329

Difficulty

10.760923

Transactions

2

Size

2.04 KB

Version

2

Bits

0ac2cbda

Nonce

1,517,859,084

Timestamp

9/23/2016, 4:26:57 PM

Confirmations

5,033,772

Merkle Root

1b3cabbab9e03889d17c1efc6b5248ed7654875d01a7f9d88ba632fcd21ec0a7
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.945 × 10⁹⁴(95-digit number)
19455976807022143318…55556397597556409289
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.945 × 10⁹⁴(95-digit number)
19455976807022143318…55556397597556409289
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.891 × 10⁹⁴(95-digit number)
38911953614044286637…11112795195112818579
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.782 × 10⁹⁴(95-digit number)
77823907228088573275…22225590390225637159
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.556 × 10⁹⁵(96-digit number)
15564781445617714655…44451180780451274319
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
3.112 × 10⁹⁵(96-digit number)
31129562891235429310…88902361560902548639
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
6.225 × 10⁹⁵(96-digit number)
62259125782470858620…77804723121805097279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.245 × 10⁹⁶(97-digit number)
12451825156494171724…55609446243610194559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.490 × 10⁹⁶(97-digit number)
24903650312988343448…11218892487220389119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.980 × 10⁹⁶(97-digit number)
49807300625976686896…22437784974440778239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.961 × 10⁹⁶(97-digit number)
99614601251953373793…44875569948881556479
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,882 XPM·at block #6,810,100 · 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