Deterministic Fully-Static Whole-Binary Translation Without Heuristics

A wild new app-translator wowed nerds, but the comments turned into a cage match

TLDR: Researchers say they can fully convert whole programs from one chip type to another before you run them, with speed close to or better than QEMU. Commenters were impressed but instantly fought over the catch: weird hand-made code, self-rewriting programs, old games, and—naturally—whether this finally helps someone run Slack on Asahi.

A new research project called Elevator just strutted into town claiming it can take an entire Windows/Linux-style program built for one kind of chip and turn it into one for another ahead of time, with no hidden runtime trickery and no guesswork shortcuts. That’s a huge deal because it means the converted app is the exact one you can test, approve, and even cryptographically sign before shipping. The paper also boasts speeds that can match or beat QEMU, a popular tool for running programs made for different hardware. Impressive? Yes. Quietly accepted by the internet? Absolutely not.

The comments instantly split into two camps: “this is brilliant” and “nice try, but reality is messier.” One skeptic dropped the ultimate party-pooper line, invoking Rice’s theorem and basically saying, “Cute paper, but weird or hostile programs will still break your dream.” Another commenter jumped straight to the question everyone loves because it sounds dangerous: can it handle self-modifying code? Translation: what happens when a program rewrites itself like a movie hacker scene? Meanwhile, retro fans wondered why this only targets modern 64-bit software when old 32-bit games are the real nostalgia jackpot.

And then came the comedy. One person cut through all the theory with the only question normal people care about: “Does it mean I can finally run Slack on Asahi?” Another veteran casually rolled in with the classic internet flex: they’d built a similar translator back in 2013 and implied QEMU’s current setup still has room to grow. So yes, the paper is about binary translation — but the real show is the comment section, where computer science doom, retro gaming dreams, and workplace chat-app desperation all collided.

Key Points

  • Elevator statically translates complete x86-64 executables to AArch64 without source code, debug information, or code layout assumptions.
  • The system considers every byte under all feasible interpretations as data, opcode, or opcode argument, generating separate control-flow paths ahead of time.
  • Elevator avoids heuristics and runtime fallback, pruning only paths that would end abnormally.
  • Its translations are built from code tiles derived automatically from a high-level description of the source ISA, producing self-contained binaries with no runtime component in the trusted code base.
  • In evaluation on real-world binaries including the full SPECint 2006 suite, Elevator reportedly achieved performance on par with or better than QEMU user-mode JIT emulation.

Hottest takes

"Cute, but Rice's theorem remains" — dmitrygr
"Can it handle self-modifying code?" — Panzerschrek
"Does it mean I can finally run Slack on Asahi?" — fguerraz
Made with <3 by @siedrix and @shesho from CDMX. Powered by Forge&Hive.