Add a Generic Decomposability to Range Checks

[hecmas]

For example, if we set $[0,2^n-1]$ to be the maximal "admissible" range, then we should automatically decompose any range check to $[0,2^m-1]$ with $m > n$ as chunks of range checks to $[0,2^n-1]$ and add the constraint that the decomposition has been performed correctly.