This code creates a predicate stating that the prover knows a representation of point X with respect to two different bases B1 and B2. This means the prover knows two secrets x1 and x2 such that X=x1*B1+x2*B2. Point X might constitute a Pedersen commitment, for example, where x1 is the value being
()