Block #1,900,077

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 12/18/2016, 12:30:54 PM · Difficulty 10.7722 · 4,933,257 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
fab84a526461e3d1fba7065b42b338b7355c3339ab28de3cd24991477a2a9bfe

Height

#1,900,077

Difficulty

10.772202

Transactions

3

Size

3.89 KB

Version

2

Bits

0ac5af05

Nonce

302,756,356

Timestamp

12/18/2016, 12:30:54 PM

Confirmations

4,933,257

Merkle Root

ddfedf61fe2393c2af5617808dee10b7cdaa15529d248b13abd486823e1c418a
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.

5.085 × 10⁹⁴(95-digit number)
50852985450404617901…40207028945997456999
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
5.085 × 10⁹⁴(95-digit number)
50852985450404617901…40207028945997456999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.017 × 10⁹⁵(96-digit number)
10170597090080923580…80414057891994913999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.034 × 10⁹⁵(96-digit number)
20341194180161847160…60828115783989827999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.068 × 10⁹⁵(96-digit number)
40682388360323694320…21656231567979655999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
8.136 × 10⁹⁵(96-digit number)
81364776720647388641…43312463135959311999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.627 × 10⁹⁶(97-digit number)
16272955344129477728…86624926271918623999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.254 × 10⁹⁶(97-digit number)
32545910688258955456…73249852543837247999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.509 × 10⁹⁶(97-digit number)
65091821376517910913…46499705087674495999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.301 × 10⁹⁷(98-digit number)
13018364275303582182…92999410175348991999
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.603 × 10⁹⁷(98-digit number)
26036728550607164365…85998820350697983999
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,910,867 XPM·at block #6,833,333 · 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