Block #495,140

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.

9.280 × 10⁹⁹(100-digit number)

92801300696901316321…68000932202004695041

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

9.280 × 10⁹⁹(100-digit number)

92801300696901316321…68000932202004695041

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^1 × origin + 1

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

18560260139380263264…36001864404009390081

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^2 × origin + 1

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

37120520278760526528…72003728808018780161

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^3 × origin + 1

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

74241040557521053057…44007457616037560321

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^4 × origin + 1

1.484 × 10¹⁰¹(102-digit number)

14848208111504210611…88014915232075120641

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^5 × origin + 1

2.969 × 10¹⁰¹(102-digit number)

29696416223008421222…76029830464150241281

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^6 × origin + 1

5.939 × 10¹⁰¹(102-digit number)

59392832446016842445…52059660928300482561

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^7 × origin + 1

1.187 × 10¹⁰²(103-digit number)

11878566489203368489…04119321856600965121

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^8 × origin + 1

2.375 × 10¹⁰²(103-digit number)

23757132978406736978…08238643713201930241

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^9 × origin + 1

4.751 × 10¹⁰²(103-digit number)

47514265956813473956…16477287426403860481

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

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

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

Cross-reference on Chainz Explorer