where k is the number of bits to use and from this we know b ⊂ Q 0 . Given n total bits over the primitives that have multiple values set, the possible ways to split these n bits of Q 0 k ways is exponential. Searching this space, or considering all bit combinations, is generally not feasible. We show in this work that parameter search can proceed for k n (or k ≈ n) by performing incremental searches. This effectively prevents the search of chemical space from being exponential and polynomial if k is small. The case of k = 1 corresponds to searching using bi individually, giving n possible ways to split S 0 , whereas k = 2 gives approximately n 2 different ways to split S 0 . To extend the search further, we can also use the partial inverse of bi , where we invert only the primitive where the single bit is set. In this context, inversion of a primitive means to flip all bits, and in two's compliment encoding this is just the negative of the integer that represents the primitive minus 1, or -z -1 (Sec. II A). This is useful in certain situations when k > 1 since the number of ways to build b is related to the power set 2 k . For example, if we have 3 manipulations and we can invert each of them, then there are up to 2 3 different manipulations, and all are potentially unique. Take a simple case