IdeaWell

Project ideas from Hacker News discussions.

Deterministic Primality Testing for Limited Bit Width

Original Article

Hacker News Discussion

📝 Discussion Summary (Click to expand)

Prevalent Themes inthe Discussion

  1. Preference for Sieve of Eratosthenes

    "but i still preferred the 4Gb file i produced via sieve of eratosthenes for most of the problems where i could use it." — nh23423fefe

  2. Use of Miller‑Rabin for Project Euler

    "i remember implementing miller rabin for project euler." — nh23423fefe

  3. Memory‑intensive, file‑size‑driven approach

    "4Gb file i produced via sieve of eratosthenes" — nh23423fefe

🚀 Project Ideas

Generating project ideas…

PrimeCache CLI

Summary

  • A lightweight command‑line utility that pre‑computes and caches massive prime sieves (e.g., up to billions) on the user's machine, eliminating repeated heavy sieving for Project Euler or crypto tasks.
  • Solves the friction of recomputing large prime tables and saves minutes‑to‑hours of CPU time.

Details

Key Value
Target Audience Hobbyist programmers, Project Euler participants, crypto‑enthusiasts
Core Feature Persistent local cache of segmented sieve outputs, instant retrieval via simple CLI flags
Tech Stack Rust (for speed) + SQLite for metadata; optional Python wrapper
Difficulty Medium
Monetization Hobby

Notes- HN users lament the need to re‑run a 4 GB sieve; this tool makes that a one‑time operation.

  • Sparks community discussion on performance tricks and sharing cache formats.

PrimeShare API

Summary

  • A hosted REST API that returns compressed prime lists on demand, with versioned endpoints (e.g., /primes?up_to=1e9), enabling users to fetch massive tables without local computation.
  • Removes the need for each user to generate and store large prime files locally.

Details

Key Value
Target Audience Researchers, competitive programmers, developers needing on‑the‑fly prime data
Core Feature API endpoint delivering pre‑computed, chunked prime data (gzip/brotli) with pagination
Tech Stack Python FastAPI + PostgreSQL (or Redis) for storage; Docker deployment
Difficulty High
Monetization Revenue-ready: Tiered usage pricing (e.g., $0.001 per GB fetched)

Notes

  • Commenters expressed frustration over repeatedly producing a 4 GB file; this service would let them query once and reuse.
  • Opens dialogue about open‑source contribution models and potential licensing.

EulerPrime Helper

Summary

  • A VS Code extension (and accompanying Python module) that seamlessly integrates prime generation, caching, and Miller‑Rabin testing into the workflow of Project Euler solvers.
  • Provides one‑click sieving, cached results in the workspace, and auto‑completion of prime checks.

Details| Key | Value |

|-----|-------| | Target Audience | Project Euler participants, competitive coding students, math‑oriented developers | | Core Feature | UI button to generate/sieve primes up to a chosen limit, store them locally, and run Miller‑Rabin tests | | Tech Stack | TypeScript (VS Code API) + Python (via python-language-server), optional Jupyter notebook integration | | Difficulty | Low | | Monetization | Hobby |

Notes

  • Directly addresses the pain point of “preferring the 4 GB file” by making cache creation trivial and shareable.
  • Likely to generate discussion on extending the tool with community‑shared prime packs.

Read Later