Block #290,638

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.

2.483 × 10¹⁰³(104-digit number)

24832602501886595580…50258135584515119039

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.

origin − 1

2.483 × 10¹⁰³(104-digit number)

24832602501886595580…50258135584515119039

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^1 × origin − 1

4.966 × 10¹⁰³(104-digit number)

49665205003773191160…00516271169030238079

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^2 × origin − 1

9.933 × 10¹⁰³(104-digit number)

99330410007546382321…01032542338060476159

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^3 × origin − 1

1.986 × 10¹⁰⁴(105-digit number)

19866082001509276464…02065084676120952319

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^4 × origin − 1

3.973 × 10¹⁰⁴(105-digit number)

39732164003018552928…04130169352241904639

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^5 × origin − 1

7.946 × 10¹⁰⁴(105-digit number)

79464328006037105856…08260338704483809279

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^6 × origin − 1

1.589 × 10¹⁰⁵(106-digit number)

15892865601207421171…16520677408967618559

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^7 × origin − 1

3.178 × 10¹⁰⁵(106-digit number)

31785731202414842342…33041354817935237119

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^8 × origin − 1

6.357 × 10¹⁰⁵(106-digit number)

63571462404829684685…66082709635870474239

Verify on FactorDB ↗Wolfram Alpha ↗

What this block proved

The miner who found this block proved the existence of 9 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

CommonChain length 9

Found in most blocks. The baseline for Primecoin's proof-of-work.

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, …

Cross-reference on Chainz Explorer

Block #290,638

Cookie Preferences