Block #132,395

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.975 × 10⁹⁸(99-digit number)

19752009014220805061…74019343601746548581

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.975 × 10⁹⁸(99-digit number)

19752009014220805061…74019343601746548581

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^1 × origin + 1

3.950 × 10⁹⁸(99-digit number)

39504018028441610122…48038687203493097161

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^2 × origin + 1

7.900 × 10⁹⁸(99-digit number)

79008036056883220245…96077374406986194321

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^3 × origin + 1

1.580 × 10⁹⁹(100-digit number)

15801607211376644049…92154748813972388641

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^4 × origin + 1

3.160 × 10⁹⁹(100-digit number)

31603214422753288098…84309497627944777281

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^5 × origin + 1

6.320 × 10⁹⁹(100-digit number)

63206428845506576196…68618995255889554561

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^6 × origin + 1

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

12641285769101315239…37237990511779109121

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^7 × origin + 1

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

25282571538202630478…74475981023558218241

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^8 × origin + 1

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

50565143076405260957…48951962047116436481

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 Second 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 2CC formula:

2CC: p₁ (first prime), p₂ = 2p₁ − 1, p₃ = 2p₂ − 1, …

Cross-reference on Chainz Explorer