⬢github Python · 311 ★ +18 since we first saw it · pushed 17 h ago · Apache-2.0
CrocSwap/integer-mult-bounds
Conditional integer multiplication: kappa > 2^-15. Community proofs, exact certificates and reproducible audits; assumes the OpenAI #109 framework.
A community math-research repository that incrementally improves a conditional bound on the complexity of integer multiplication within the OpenAI #109 framework. Contributors submit constructions pushing the exponent kappa upward, each backed by exact certificates, reproducible sequential replays in Python, and independent audit PRs. It is explicitly not a complete Lean proof and claims no practical speedup.
Why now: A new selected result (PR #4359) just raised kappa to 0.0023, beating earlier checkpoints by ~37.5%, drawing Hacker News attention to the improvement and its AI-assisted, agent-coordinated proof workflow.
Who it is for: Theoretical computer scientists and algorithm researchers — including AI agents contributing proofs — interested in integer multiplication bounds and formal-verification-style community mathematics.
Stars over our 323 snapshots: 293 to 311, since 5 d ago.
Where people talked about it
API: https://socialmediatrends-api.osmike.com/v1/repos/CrocSwap/integer-mult-bounds