Block #1,659,591

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 7/4/2016, 2:46:38 PM · Difficulty 10.7578 · 5,152,551 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
c85dd6ca6913b7d6ca4a189b3adbe4452f23db3835b3400aa9e3528794f02b5e

Height

#1,659,591

Difficulty

10.757760

Transactions

3

Size

5.41 KB

Version

2

Bits

0ac1fc94

Nonce

403,135,986

Timestamp

7/4/2016, 2:46:38 PM

Confirmations

5,152,551

Merkle Root

cb5ebd2f9ac3e9265e955804582ded4862a13f21a7d11aa359711ea202e4517f
Transactions (3)
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.

7.738 × 10⁹⁵(96-digit number)
77383793692058544000…64969527836648775679
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
7.738 × 10⁹⁵(96-digit number)
77383793692058544000…64969527836648775679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.547 × 10⁹⁶(97-digit number)
15476758738411708800…29939055673297551359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
3.095 × 10⁹⁶(97-digit number)
30953517476823417600…59878111346595102719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
6.190 × 10⁹⁶(97-digit number)
61907034953646835200…19756222693190205439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
1.238 × 10⁹⁷(98-digit number)
12381406990729367040…39512445386380410879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
2.476 × 10⁹⁷(98-digit number)
24762813981458734080…79024890772760821759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
4.952 × 10⁹⁷(98-digit number)
49525627962917468160…58049781545521643519
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
9.905 × 10⁹⁷(98-digit number)
99051255925834936321…16099563091043287039
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.981 × 10⁹⁸(99-digit number)
19810251185166987264…32199126182086574079
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.962 × 10⁹⁸(99-digit number)
39620502370333974528…64398252364173148159
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,741,151 XPM·at block #6,812,141 · 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