Block #462,558

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.575 × 10⁹⁹(100-digit number)

15753722019911816642…36767941818817762639

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.575 × 10⁹⁹(100-digit number)

15753722019911816642…36767941818817762639

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^1 × origin − 1

3.150 × 10⁹⁹(100-digit number)

31507444039823633285…73535883637635525279

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^2 × origin − 1

6.301 × 10⁹⁹(100-digit number)

63014888079647266570…47071767275271050559

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^3 × origin − 1

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

12602977615929453314…94143534550542101119

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^4 × origin − 1

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

25205955231858906628…88287069101084202239

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^5 × origin − 1

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

50411910463717813256…76574138202168404479

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^6 × origin − 1

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

10082382092743562651…53148276404336808959

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^7 × origin − 1

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

20164764185487125302…06296552808673617919

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^8 × origin − 1

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

40329528370974250604…12593105617347235839

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^9 × origin − 1

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

80659056741948501209…25186211234694471679

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