Block #605,629

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.

6.663 × 10⁹⁹(100-digit number)

66635532953782905046…75201828271097518079

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

6.663 × 10⁹⁹(100-digit number)

66635532953782905046…75201828271097518079

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^1 × origin − 1

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

13327106590756581009…50403656542195036159

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^2 × origin − 1

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

26654213181513162018…00807313084390072319

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^3 × origin − 1

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

53308426363026324037…01614626168780144639

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^4 × origin − 1

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

10661685272605264807…03229252337560289279

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^5 × origin − 1

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

21323370545210529614…06458504675120578559

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^6 × origin − 1

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

42646741090421059229…12917009350241157119

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^7 × origin − 1

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

85293482180842118459…25834018700482314239

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^8 × origin − 1

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

17058696436168423691…51668037400964628479

Verify on FactorDB ↗Wolfram Alpha ↗

×2+1 →

2^9 × origin − 1

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

34117392872336847383…03336074801929256959

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