Block #395,426

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.

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

42265975242134258479…46187157529607700481

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

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

42265975242134258479…46187157529607700481

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^1 × origin + 1

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

84531950484268516959…92374315059215400961

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^2 × origin + 1

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

16906390096853703391…84748630118430801921

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^3 × origin + 1

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

33812780193707406783…69497260236861603841

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^4 × origin + 1

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

67625560387414813567…38994520473723207681

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^5 × origin + 1

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

13525112077482962713…77989040947446415361

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^6 × origin + 1

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

27050224154965925426…55978081894892830721

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^7 × origin + 1

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

54100448309931850853…11956163789785661441

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^8 × origin + 1

1.082 × 10¹⁰³(104-digit number)

10820089661986370170…23912327579571322881

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^9 × origin + 1

2.164 × 10¹⁰³(104-digit number)

21640179323972740341…47824655159142645761

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