Block #488,591

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/12/2014, 7:05:27 PM · Difficulty 10.6575 · 6,321,567 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
8bc4dbca6f9c8e2f23f19ce85c360615a8c26b4efedfb296d8942b6c2f2e1570

Height

#488,591

Difficulty

10.657463

Transactions

3

Size

1.34 KB

Version

2

Bits

0aa84f86

Nonce

62,318

Timestamp

4/12/2014, 7:05:27 PM

Confirmations

6,321,567

Merkle Root

bda3b909d5e3b2b467c5dd2860304fc13aa2ae76984fd911a209e8967bd0688d
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.564 × 10⁹⁸(99-digit number)
45642193695759550160…10026692767198914559
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.564 × 10⁹⁸(99-digit number)
45642193695759550160…10026692767198914559
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
9.128 × 10⁹⁸(99-digit number)
91284387391519100321…20053385534397829119
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.825 × 10⁹⁹(100-digit number)
18256877478303820064…40106771068795658239
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.651 × 10⁹⁹(100-digit number)
36513754956607640128…80213542137591316479
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.302 × 10⁹⁹(100-digit number)
73027509913215280257…60427084275182632959
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.460 × 10¹⁰⁰(101-digit number)
14605501982643056051…20854168550365265919
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.921 × 10¹⁰⁰(101-digit number)
29211003965286112103…41708337100730531839
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.842 × 10¹⁰⁰(101-digit number)
58422007930572224206…83416674201461063679
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.168 × 10¹⁰¹(102-digit number)
11684401586114444841…66833348402922127359
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.336 × 10¹⁰¹(102-digit number)
23368803172228889682…33666696805844254719
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,725,330 XPM·at block #6,810,157 · 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.

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