Block #604,270

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

11463827863215788308…51567721300496332799

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

11463827863215788308…51567721300496332799

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^1 × origin − 1

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

22927655726431576617…03135442600992665599

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^2 × origin − 1

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

45855311452863153235…06270885201985331199

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^3 × origin − 1

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

91710622905726306471…12541770403970662399

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^4 × origin − 1

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

18342124581145261294…25083540807941324799

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^5 × origin − 1

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

36684249162290522588…50167081615882649599

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^6 × origin − 1

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

73368498324581045177…00334163231765299199

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^7 × origin − 1

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

14673699664916209035…00668326463530598399

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^8 × origin − 1

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

29347399329832418070…01336652927061196799

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^9 × origin − 1

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

58694798659664836141…02673305854122393599

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