Bend makes AGENTS.md a theorem: declare an invariant and the compiler refuses AI code that breaks it
Bend, trending at 502 points on Hacker News on 17 September, pairs Python-like syntax with Lean proofs, C-speed single-core execution and CUDA parallelism from the same binary. Its LAWS.bend file is pitched as 'AGENTS.md backed by proof': you declare invariants that must never break, and the compiler verifies AI-generated code maintains them, so 'merging a bug is mathematically impossible: it is a theorem.' Type checking takes at most a second, which is the design constraint that makes it usable inside an agent loop. The project warns it is still evolving and publishes no hard benchmarks beyond qualitative C and multicore comparisons, so treat the speed claims as unverified. The idea is the interesting part: machine-checkable constraints instead of prose instructions an agent can ignore.
Source
↳ Follow the thread