EvoSort: An Audit Protocol for LLM-Driven Program Search—Correctness, Ablation, and the Cost of Too Few Seeds
EvoSort evolves compiled C++ sorting routines. A language model proposes mutations of a baseline sorter, a per-context upper confidence bound (UCB1) bandit picks which operator to try, and a four-gate harness decides whether a candidate may be timed at all. This paper reports what happened when that system was audited...