Block #298,178

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.250 × 10¹¹⁰(111-digit number)

12503436441294493193…15401446369828787199

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

1.250 × 10¹¹⁰(111-digit number)

12503436441294493193…15401446369828787199

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^1 × origin − 1

2.500 × 10¹¹⁰(111-digit number)

25006872882588986387…30802892739657574399

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^2 × origin − 1

5.001 × 10¹¹⁰(111-digit number)

50013745765177972775…61605785479315148799

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^3 × origin − 1

1.000 × 10¹¹¹(112-digit number)

10002749153035594555…23211570958630297599

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^4 × origin − 1

2.000 × 10¹¹¹(112-digit number)

20005498306071189110…46423141917260595199

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^5 × origin − 1

4.001 × 10¹¹¹(112-digit number)

40010996612142378220…92846283834521190399

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^6 × origin − 1

8.002 × 10¹¹¹(112-digit number)

80021993224284756440…85692567669042380799

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^7 × origin − 1

1.600 × 10¹¹²(113-digit number)

16004398644856951288…71385135338084761599

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^8 × origin − 1

3.200 × 10¹¹²(113-digit number)

32008797289713902576…42770270676169523199

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^9 × origin − 1

6.401 × 10¹¹²(113-digit number)

64017594579427805152…85540541352339046399

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

Cross-reference on Chainz Explorer