LLM Compiler Superoptimization
I am working on making LLM-based code optimization practical beyond isolated functions. My work extends a compiler-superoptimization pipeline to multi-file C and C++ programs and develops the search, verification, and evaluation infrastructure needed to test changes safely at scale. The benchmark currently covers 139 cases from 49 LLVM benchmark families, including the 87-file SPASS theorem prover.
In an 11-workload study, I orchestrated 400 optimization attempts with 16 parallel search workers and four verifier agents. By sending verifiers only new evidence and using their counterexamples to refine optimization constraints, I reduced later prompt sizes by about 75% and improved aggregate speedup on the targeted workloads from 1.07× to 1.24× while preserving correctness.