Block #1,951,603

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 1/23/2017, 10:30:40 PM · Difficulty 10.7291 · 4,887,775 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8d0a09f305eab1636519a7e974c8307db819235f5437b3633ca55bef3b43d695

Height

#1,951,603

Difficulty

10.729119

Transactions

2

Size

1.04 KB

Version

2

Bits

0abaa786

Nonce

1,088,191,417

Timestamp

1/23/2017, 10:30:40 PM

Confirmations

4,887,775

Merkle Root

2834da5b5e1113b0811065689fe6050d211ea02c8a8d00a189e778839aea4e1d
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.336 × 10⁹²(93-digit number)
33363465871772843471…57835020721926724279
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.336 × 10⁹²(93-digit number)
33363465871772843471…57835020721926724279
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
6.672 × 10⁹²(93-digit number)
66726931743545686942…15670041443853448559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.334 × 10⁹³(94-digit number)
13345386348709137388…31340082887706897119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
2.669 × 10⁹³(94-digit number)
26690772697418274777…62680165775413794239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
5.338 × 10⁹³(94-digit number)
53381545394836549554…25360331550827588479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.067 × 10⁹⁴(95-digit number)
10676309078967309910…50720663101655176959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.135 × 10⁹⁴(95-digit number)
21352618157934619821…01441326203310353919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
4.270 × 10⁹⁴(95-digit number)
42705236315869239643…02882652406620707839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
8.541 × 10⁹⁴(95-digit number)
85410472631738479286…05765304813241415679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
1.708 × 10⁹⁵(96-digit number)
17082094526347695857…11530609626482831359
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,959,307 XPM·at block #6,839,377 · 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