MATHEMATICS / NUMBER THEORY / SYSTEMS
ES-ASM-SNIPER
A C and assembly search kernel that separates finite Erdős–Straus residuals from checkable certificates.
- Current state
- Certificate experiment
- Discipline
- Mathematics · Number theory · Systems
- Built with
- C / AArch64 assembly / x86-64 assembly / Make / SHA-256 records
The idea
The Erdős–Straus search problem demands exact evidence rather than impressive search counts. ES-ASM-SNIPER focuses on a defined modular search region and separates an optimized hunt from independent certificate construction and verification.
How it works
A segmented modular sieve and exact integer routines drive the search. Handwritten AArch64 and x86-64 modular multiplication support the hot path, with C fallbacks. Independent certification and verification programs preserve a distinction between incomplete menu residuals and complete bounded regions.
What’s implemented
- Modular residue-class search with configurable bounds and threads
- C and assembly modular arithmetic with exact identity checks
- Append-only range ownership and resumable search manifests
- Separate certificate creation and third-party reconstruction programs
PROJECT STATUS / CERTIFICATE EXPERIMENT
Where it stands
Finite search and certificate experiment
- A bounded computational research kernel, not a proof of the Erdős–Straus conjecture
- A miss in the search menu is not an unsolved integer or a universal disproof
- Complete-region certification has explicit implementation bounds; wrapping arithmetic cannot certify
Source & resources
Documentation behind this project page
Reviewed October 1, 2026. Project descriptions reflect a source review; repository validation claims were not independently reproduced.