The current ALU design is tailored for recursion, with non-usual operations specific to the main bottlenecks of the recursion circuit (e.g. Accumulated Horner step in FRI).
Because this library aims at being more generic, providing convenient tooling for building circuits, it would be nice to split the logic into a generic ALU table, with usual operations, enough for most applications, and a recursion optimized one. Note that the codebase already supports the underlying logic since #313.
The current ALU design is tailored for recursion, with non-usual operations specific to the main bottlenecks of the recursion circuit (e.g. Accumulated Horner step in FRI).
Because this library aims at being more generic, providing convenient tooling for building circuits, it would be nice to split the logic into a generic ALU table, with usual operations, enough for most applications, and a recursion optimized one. Note that the codebase already supports the underlying logic since #313.