Block #492,658

1CCLength 10★★☆☆☆

Cunningham Chain of the First Kind · Discovered 4/15/2014, 7:05:34 AM · Difficulty 10.6883 · 6,321,452 confirmations

1CC
Cunningham Chain of the First Kind

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

Block Header
Block Hash
88cecf0d1b0c7f385068e80502fb68fed35d9bf59f710394846c3a7a27923108

Height

#492,658

Difficulty

10.688287

Transactions

1

Size

902 B

Version

2

Bits

0ab0338f

Nonce

16,047

Timestamp

4/15/2014, 7:05:34 AM

Confirmations

6,321,452

Merkle Root

099b7154fa95ef0326327ef8a7a3e973162ff60de162e7db95efe1110ff3ce63
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.421 × 10⁹⁷(98-digit number)
44210057988492069056…02992864575421875199
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.421 × 10⁹⁷(98-digit number)
44210057988492069056…02992864575421875199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
2
2^1 × origin − 1
8.842 × 10⁹⁷(98-digit number)
88420115976984138112…05985729150843750399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
3
2^2 × origin − 1
1.768 × 10⁹⁸(99-digit number)
17684023195396827622…11971458301687500799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
4
2^3 × origin − 1
3.536 × 10⁹⁸(99-digit number)
35368046390793655244…23942916603375001599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
5
2^4 × origin − 1
7.073 × 10⁹⁸(99-digit number)
70736092781587310489…47885833206750003199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
6
2^5 × origin − 1
1.414 × 10⁹⁹(100-digit number)
14147218556317462097…95771666413500006399
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
7
2^6 × origin − 1
2.829 × 10⁹⁹(100-digit number)
28294437112634924195…91543332827000012799
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
8
2^7 × origin − 1
5.658 × 10⁹⁹(100-digit number)
56588874225269848391…83086665654000025599
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
9
2^8 × origin − 1
1.131 × 10¹⁰⁰(101-digit number)
11317774845053969678…66173331308000051199
Verify on FactorDB ↗Wolfram Alpha ↗
×2+1 →
10
2^9 × origin − 1
2.263 × 10¹⁰⁰(101-digit number)
22635549690107939356…32346662616000102399
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,756,962 XPM·at block #6,814,109 · 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