Not sure whether Iota, Jot, and lambda calculus can be executed instruction-by-instruction, but generally speaking, wouldn’t a Turing-complete language with just two instructions allow for even greater throughput than BrainFuck does?