Block #398,265

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.946 × 10⁹⁷(98-digit number)

39467673839098727471…08544142172840565759

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.946 × 10⁹⁷(98-digit number)

39467673839098727471…08544142172840565759

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^1 × origin − 1

7.893 × 10⁹⁷(98-digit number)

78935347678197454942…17088284345681131519

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^2 × origin − 1

1.578 × 10⁹⁸(99-digit number)

15787069535639490988…34176568691362263039

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^3 × origin − 1

3.157 × 10⁹⁸(99-digit number)

31574139071278981976…68353137382724526079

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^4 × origin − 1

6.314 × 10⁹⁸(99-digit number)

63148278142557963953…36706274765449052159

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^5 × origin − 1

1.262 × 10⁹⁹(100-digit number)

12629655628511592790…73412549530898104319

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^6 × origin − 1

2.525 × 10⁹⁹(100-digit number)

25259311257023185581…46825099061796208639

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^7 × origin − 1

5.051 × 10⁹⁹(100-digit number)

50518622514046371163…93650198123592417279

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^8 × origin − 1

1.010 × 10¹⁰⁰(101-digit number)

10103724502809274232…87300396247184834559

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^9 × origin − 1

2.020 × 10¹⁰⁰(101-digit number)

20207449005618548465…74600792494369669119

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