Block #1,612,258

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 6/3/2016, 11:02:39 AM · Difficulty 10.6024 · 5,213,062 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
12f3350895447d3324a3e3218fc7c1ad5f1ea18a5336899a5dc1846c76825183

Height

#1,612,258

Difficulty

10.602367

Transactions

7

Size

10.98 KB

Version

2

Bits

0a9a34b8

Nonce

1,029,014,511

Timestamp

6/3/2016, 11:02:39 AM

Confirmations

5,213,062

Merkle Root

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

4.701 × 10⁹⁶(97-digit number)
47017902132104802004…54912695933206681599
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
4.701 × 10⁹⁶(97-digit number)
47017902132104802004…54912695933206681599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.403 × 10⁹⁶(97-digit number)
94035804264209604008…09825391866413363199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.880 × 10⁹⁷(98-digit number)
18807160852841920801…19650783732826726399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.761 × 10⁹⁷(98-digit number)
37614321705683841603…39301567465653452799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.522 × 10⁹⁷(98-digit number)
75228643411367683206…78603134931306905599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.504 × 10⁹⁸(99-digit number)
15045728682273536641…57206269862613811199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.009 × 10⁹⁸(99-digit number)
30091457364547073282…14412539725227622399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
6.018 × 10⁹⁸(99-digit number)
60182914729094146565…28825079450455244799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.203 × 10⁹⁹(100-digit number)
12036582945818829313…57650158900910489599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.407 × 10⁹⁹(100-digit number)
24073165891637658626…15300317801820979199
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,846,665 XPM·at block #6,825,319 · 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