verify

Verify that a span of V_i = g^b_i h^r_i are encoding either b=1 or b=0 and that those b_i are indeed the binary decomposition b = sum_i b_i 2^i. With the b that is encoded in V = g^b h^r. (Note that r = sum_i r_i 2^i)

EC_MUL: bit_size * ( 4 + 1 ) (160 for u32); EC_ADD: bit_size * ( 3 + 1 ) (128 for u32)

Fully qualified path: she::protocols::range::verify

pub fn verify(inputs: RangeInputs, proof: RangeProof) -> Result<NonZero<EcPoint>, Errors>