Show HN: Math Gambling
21 days ago
- The article describes an open volunteer search for integer solutions to x³ + y³ + z³ = 114, which passes the necessary modulo 9 test but does not guarantee existence of a solution.
- The search uses a cubic-field norm construction with exact arithmetic, modular rejection, bounded client tasks, and durable result receipts, focusing on selected domains rather than exhaustive height search.
- Volunteer execution involves opt-in browser clients using BigInt arithmetic and a portable local runner using Python integers, with task receipts banked as GitHub issues for attribution and verification.
- After each epoch of 64 verified tasks, a versioned policy reserves at least 40% for exploration, with observed replay costs informing further allocation, but does not estimate solution probability.
- Validation includes recovering all 662 known-positive fixtures, arithmetic-boundary checks, and independent cross-language tests, though no formal proof of the complete software stack is claimed.
- The result section is intentionally left unfilled, requiring an actual verified solution with evidence of discovery and independent reproduction.
- Reproducibility and attribution are maintained through a GitHub repository, with authorship requiring evidence and agreement beyond mere participation.