Block #1,544,460

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/16/2016, 9:04:17 PM · Difficulty 10.6522 · 5,273,313 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
b297c6053deedc7541ad42cbb1b8d71fa21f75a2176326c354357508f3c0588e

Height

#1,544,460

Difficulty

10.652215

Transactions

2

Size

1.08 KB

Version

2

Bits

0aa6f789

Nonce

263,901,100

Timestamp

4/16/2016, 9:04:17 PM

Confirmations

5,273,313

Merkle Root

842fbb1b3554e8dbc33c0260726d77d8cbd587fb8b332ec1cd40dd4c7f53ab57
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.961 × 10⁹³(94-digit number)
59618952299995249434…27180742606549841599
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.961 × 10⁹³(94-digit number)
59618952299995249434…27180742606549841599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
1.192 × 10⁹⁴(95-digit number)
11923790459999049886…54361485213099683199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
2.384 × 10⁹⁴(95-digit number)
23847580919998099773…08722970426199366399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
4.769 × 10⁹⁴(95-digit number)
47695161839996199547…17445940852398732799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
9.539 × 10⁹⁴(95-digit number)
95390323679992399095…34891881704797465599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.907 × 10⁹⁵(96-digit number)
19078064735998479819…69783763409594931199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
3.815 × 10⁹⁵(96-digit number)
38156129471996959638…39567526819189862399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
7.631 × 10⁹⁵(96-digit number)
76312258943993919276…79135053638379724799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.526 × 10⁹⁶(97-digit number)
15262451788798783855…58270107276759449599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
3.052 × 10⁹⁶(97-digit number)
30524903577597567710…16540214553518899199
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,786,241 XPM·at block #6,817,772 · 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