Block #1,759,511

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 9/12/2016, 9:50:46 AM · Difficulty 10.7311 · 5,084,030 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
6936e8cadf4b3f90980b8798e252b1da6f5c3517b5f95fca2b7234daf91fd064

Height

#1,759,511

Difficulty

10.731114

Transactions

2

Size

872 B

Version

2

Bits

0abb2a51

Nonce

1,192,837,611

Timestamp

9/12/2016, 9:50:46 AM

Confirmations

5,084,030

Merkle Root

4b7188c051bbce6b5d745d416d071c5d7d712f3404651d1a63e0acd3554b33ac
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.

1.685 × 10⁹⁶(97-digit number)
16856337338557697345…72020081862236743999
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.685 × 10⁹⁶(97-digit number)
16856337338557697345…72020081862236743999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.371 × 10⁹⁶(97-digit number)
33712674677115394690…44040163724473487999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
6.742 × 10⁹⁶(97-digit number)
67425349354230789381…88080327448946975999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.348 × 10⁹⁷(98-digit number)
13485069870846157876…76160654897893951999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.697 × 10⁹⁷(98-digit number)
26970139741692315752…52321309795787903999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.394 × 10⁹⁷(98-digit number)
53940279483384631505…04642619591575807999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.078 × 10⁹⁸(99-digit number)
10788055896676926301…09285239183151615999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.157 × 10⁹⁸(99-digit number)
21576111793353852602…18570478366303231999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.315 × 10⁹⁸(99-digit number)
43152223586707705204…37140956732606463999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
8.630 × 10⁹⁸(99-digit number)
86304447173415410408…74281913465212927999
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,992,703 XPM·at block #6,843,540 · 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