This decomposes a field element into K-bit words and constrains each word's range by looking it up in a K-bit lookup table. The field element is broken down using a running sum. All interstitial values of the running sum are returned.
Co-authored-by: Jack Grigg <jack@electriccoin.co>