Block #1,592,308

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 5/20/2016, 4:06:53 AM · Difficulty 10.6478 · 5,232,440 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
4ec14b6b11eb1a638061c30d0df86b3eccab9636349d69170b8b175d21516d9e

Height

#1,592,308

Difficulty

10.647788

Transactions

2

Size

935 B

Version

2

Bits

0aa5d568

Nonce

350,975,728

Timestamp

5/20/2016, 4:06:53 AM

Confirmations

5,232,440

Merkle Root

2715715522511f41758e48286cd9703abaf033ef3a48db32ce17d93192912969
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.287 × 10⁹⁴(95-digit number)
12877664549136774232…07131967189787714959
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.287 × 10⁹⁴(95-digit number)
12877664549136774232…07131967189787714959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
2.575 × 10⁹⁴(95-digit number)
25755329098273548465…14263934379575429919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
5.151 × 10⁹⁴(95-digit number)
51510658196547096931…28527868759150859839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.030 × 10⁹⁵(96-digit number)
10302131639309419386…57055737518301719679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.060 × 10⁹⁵(96-digit number)
20604263278618838772…14111475036603439359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
4.120 × 10⁹⁵(96-digit number)
41208526557237677544…28222950073206878719
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
8.241 × 10⁹⁵(96-digit number)
82417053114475355089…56445900146413757439
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
1.648 × 10⁹⁶(97-digit number)
16483410622895071017…12891800292827514879
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
3.296 × 10⁹⁶(97-digit number)
32966821245790142035…25783600585655029759
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
6.593 × 10⁹⁶(97-digit number)
65933642491580284071…51567201171310059519
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,842,055 XPM·at block #6,824,747 · 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