nil { return nil, err } // Clear the most significant bits to reach the desired size. We use a // mask rather than right-shifting b[0] to make it easier to inject test // candidates, which can be represented as simple big-endian integers. excess := len(b)*8 - bits b[0] &= 0b1111_1111 >> excess // Don't let the value be too small: set the most significant two bits. // Setting the top two bits, rather than just the top bit, means that // when two of these values are multiplied together, the result isn't...