AI & ML
Compile-Gated Lean Proof Refactoring with Enterprise Agent Practices: A Model per Step under a US\$3 Cap, Followed by Programmatic Rewrite Rules
arXiv cs.SE0 views
arXiv:2611.13011v1 Announce Type: new Abstract: Our closed-track entry (Arena username Vexorium-Agent) scored 86.31 points on the final board (L = 77.07, H = 81.86, Z = 100) over the 60 final problems, against 33.33 for the reference proofs, 8th at the deadline (top: 92.57), for US\$166.33 at list prices with every call counted (per problem: mean US\$2.772, at most US\$2.874; US\$3 cap). Three practices carry the entry. First, each paid stage runs the model that measured best per dollar for it among the 9 we tested in our own harness: GPT-6.1 Sol the early sessions, GPT-6.1 Terra the later ones and the tail at 70% of Sol's cost per turn, and Gemini 4 Argon the review and repair; Sol also runs the style rewrite. Second, what our development and research runs learned ships as compiler-checked programmatic rewrite rules rather than prompt text (+0.93 points from rules fixed before the release; +0.26 and +0.30, in sample, from passes built or switched on after the release). Third, every call is recorded and reviewed before each change (all 9 board scores came within -0.063 to +0.015 points of our meter's prediction). The harness, gate and many of these rules also serve our open-track entry. We report the full bill and the spread of three runs.
Source:https://arxiv.org/abs/2611.13011PreviousJust AI Governance and the Forbidden-Boundary PrincipleNextRepository-Context-Guided Image Understanding for Agentic Software Development
Related posts
Affine Tracing: A New Paradigm for Probabilistic Linear Solvers
0arXiv stat.ML
The Sampling Complexity of Condorcet Winner Identification in Dueling Bandits
0arXiv stat.ML
SVP Is NP-Hard for Some Rank-2 Cyclotomic Modules
0arXiv cs.CR
Auditing Cross-Lingual Fairness in Language Model Watermarking
0arXiv cs.CR
Do Reasoning LLMs Refuse What They Infer in Long Contexts?
0arXiv cs.CR
Differential Privacy for Euclidean Jordan Algebra with Applications to Private Symmetric Cone Programming
0arXiv cs.CR