Block #275,591

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.

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

33454566693639245902…08429758667050729599

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

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

33454566693639245902…08429758667050729599

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^1 × origin − 1

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

66909133387278491805…16859517334101459199

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^2 × origin − 1

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

13381826677455698361…33719034668202918399

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^3 × origin − 1

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

26763653354911396722…67438069336405836799

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^4 × origin − 1

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

53527306709822793444…34876138672811673599

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^5 × origin − 1

1.070 × 10¹⁰⁶(107-digit number)

10705461341964558688…69752277345623347199

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^6 × origin − 1

2.141 × 10¹⁰⁶(107-digit number)

21410922683929117377…39504554691246694399

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^7 × origin − 1

4.282 × 10¹⁰⁶(107-digit number)

42821845367858234755…79009109382493388799

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^8 × origin − 1

8.564 × 10¹⁰⁶(107-digit number)

85643690735716469511…58018218764986777599

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