REFORGE: Benchmarking LLMs' Reverse Engineering Capabilities in Decompiled Binary Function Naming
Koller and Schmidt argue the real obstacle to evaluating LLMs on binaries isn't model capability — it's whether you can reliably align a compiled function back to its source under optimization. Their pipeline tracks that provenance from C through compilation and DWARF, and the numbers are uncomfortable: the share of functions that can be evaluated with high confidence drops from 87.2% to 65.9% as optimization levels rise.
The consequence is worse than a lower score. If harder functions silently drop out of your evaluable set, unpaired comparisons make models look more robust to optimization than they are. That's survivorship bias sitting inside a benchmark, and it's the kind of bug you can't see from the leaderboard.