Block #401,564

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.434 × 10¹⁰⁰(101-digit number)

14349301763419623589…88929068020308957479

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.434 × 10¹⁰⁰(101-digit number)

14349301763419623589…88929068020308957479

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^1 × origin − 1

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

28698603526839247179…77858136040617914959

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^2 × origin − 1

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

57397207053678494359…55716272081235829919

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^3 × origin − 1

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

11479441410735698871…11432544162471659839

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^4 × origin − 1

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

22958882821471397743…22865088324943319679

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^5 × origin − 1

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

45917765642942795487…45730176649886639359

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^6 × origin − 1

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

91835531285885590975…91460353299773278719

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^7 × origin − 1

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

18367106257177118195…82920706599546557439

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^8 × origin − 1

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

36734212514354236390…65841413199093114879

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^9 × origin − 1

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

73468425028708472780…31682826398186229759

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

Block #401,564

Cookie Preferences