Block #491,125

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/14/2014, 7:45:46 AM · Difficulty 10.6797 · 6,325,568 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
cf654532e1600bcf04aeae3ea76d5e4bd2f7071dd9a4e641fa627005fb653973

Height

#491,125

Difficulty

10.679736

Transactions

4

Size

1.54 KB

Version

2

Bits

0aae0335

Nonce

230,489,865

Timestamp

4/14/2014, 7:45:46 AM

Confirmations

6,325,568

Merkle Root

3841cd4944a61344ccd8e4a1b84276cc111d5b1b663715d1a6a20da061882d08
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.764 × 10⁹⁸(99-digit number)
17644847763643584165…23492482940965840799
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.764 × 10⁹⁸(99-digit number)
17644847763643584165…23492482940965840799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
3.528 × 10⁹⁸(99-digit number)
35289695527287168330…46984965881931681599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
7.057 × 10⁹⁸(99-digit number)
70579391054574336661…93969931763863363199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
1.411 × 10⁹⁹(100-digit number)
14115878210914867332…87939863527726726399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
2.823 × 10⁹⁹(100-digit number)
28231756421829734664…75879727055453452799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
5.646 × 10⁹⁹(100-digit number)
56463512843659469329…51759454110906905599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
1.129 × 10¹⁰⁰(101-digit number)
11292702568731893865…03518908221813811199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
2.258 × 10¹⁰⁰(101-digit number)
22585405137463787731…07037816443627622399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
4.517 × 10¹⁰⁰(101-digit number)
45170810274927575463…14075632887255244799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
9.034 × 10¹⁰⁰(101-digit number)
90341620549855150926…28151265774510489599
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,777,666 XPM·at block #6,816,692 · 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