Block #329,605

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.

2.755 × 10⁹⁹(100-digit number)

27555757218729951704…75649736739144469761

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

2.755 × 10⁹⁹(100-digit number)

27555757218729951704…75649736739144469761

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^1 × origin + 1

5.511 × 10⁹⁹(100-digit number)

55111514437459903409…51299473478288939521

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^2 × origin + 1

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

11022302887491980681…02598946956577879041

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^3 × origin + 1

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

22044605774983961363…05197893913155758081

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^4 × origin + 1

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

44089211549967922727…10395787826311516161

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^5 × origin + 1

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

88178423099935845455…20791575652623032321

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^6 × origin + 1

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

17635684619987169091…41583151305246064641

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^7 × origin + 1

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

35271369239974338182…83166302610492129281

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^8 × origin + 1

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

70542738479948676364…66332605220984258561

Verify on FactorDB ↗Wolfram Alpha ↗

×2−1 →

2^9 × origin + 1

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

14108547695989735272…32665210441968517121

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

Block #329,605

Cookie Preferences