Private route computation (MPC)
How the committee picks a route for an amount none of them can see.
The committee runs a routing circuit over the secret-shared intent. The design is mixed-protocol, in the style of ABY3:
Arithmetic sharing handles the additions and multiplications in the constant-product and concentrated-liquidity pricing formulas. It gives an output amount for each candidate path.
Garbled circuits handle the comparisons and branching needed to pick the path with the largest output.
The output is a threshold-signed attestation naming the selected route. No party learns the amount.
Settlement
The nullifier and the plaintext intent are revealed in the same transaction that executes the swap on the attested route. The amount is never public while the trade is still unsettled.