Hi HN. I built this project as a public experiment in structured prime search.

The client is written in Rust and can also be run locally without any registration.

The goal is to investigate whether the enrichment observed in experiments with smaller primes also persists when searching for much larger probable primes.

I would really appreciate your technical feedback on the experimental design, the baseline, reproducibility, and the implementation.