Skip to content

LULZprime v0.1.0 — Reference Implementation

Choose a tag to compare

View all tags
@RobLe3 RobLe3 released this 19 Dec 13:38
· 19 commits to main since this release
v0.1.0
2d4b869

LULZprime v0.1.0 — Reference Implementation

This is the initial and final reference release of LULZprime.

LULZprime is a deterministic, exact prime computation library providing:

  • Exact π(x) (prime counting)
  • Exact n-th prime resolution via resolve(n)
  • Tier A correctness guarantees
  • Bit-identical deterministic results
  • Extremely low memory usage
  • Evidence-backed, measured performance only

This release is feature-complete and fire-and-forget.

Highlights

  • ✅ Exact Meissel–Lehmer π(x) implementation (P2 correction)
  • ✅ Practical resolve(500k) in ~73 seconds (validated)
  • ✅ Memory usage ~0.66–1.16 MB (≈15× reduction vs segmented sieve)
  • ✅ Deterministic, integer-only core
  • ✅ 169/169 tests passing
  • ✅ No runtime dependencies (stdlib only)

Maintenance Status

This project is provided as a completed reference implementation.

  • No active feature development
  • No performance roadmap
  • Forking is the intended continuation path

If you extend or modify this code, you are the maintainer of your fork.

What This Is Not

  • ❌ Not cryptography
  • ❌ Not factorization
  • ❌ Not a probabilistic model
  • ❌ Not intended for unbounded indices
  • ❌ Not a security primitive

Documentation & Theory

The canonical theoretical background (OMPC) is available externally at:
https://roblemumin.com/library.html

Support

If you leverage this library in production and it helps you save money,
please consider donating approximately 1 % of the savings to organizations supporting homeless people.

This is a request, not a license condition.

Integrity

  • Defaults unchanged (`ENABLE_LEHMER_PI = False`)
  • No algorithm changes
  • No speculative claims
  • Fully reproducible results

Status: Stable · Verified · Reference-grade

Assets 2
Loading