Block #150,463

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.703 × 10⁹¹(92-digit number)

17035485574562583658…18950741073612424961

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.703 × 10⁹¹(92-digit number)

17035485574562583658…18950741073612424961

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^1 × origin + 1

3.407 × 10⁹¹(92-digit number)

34070971149125167317…37901482147224849921

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^2 × origin + 1

6.814 × 10⁹¹(92-digit number)

68141942298250334634…75802964294449699841

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^3 × origin + 1

1.362 × 10⁹²(93-digit number)

13628388459650066926…51605928588899399681

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^4 × origin + 1

2.725 × 10⁹²(93-digit number)

27256776919300133853…03211857177798799361

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^5 × origin + 1

5.451 × 10⁹²(93-digit number)

54513553838600267707…06423714355597598721

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^6 × origin + 1

1.090 × 10⁹³(94-digit number)

10902710767720053541…12847428711195197441

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^7 × origin + 1

2.180 × 10⁹³(94-digit number)

21805421535440107082…25694857422390394881

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^8 × origin + 1

4.361 × 10⁹³(94-digit number)

43610843070880214165…51389714844780789761

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