Recall the algorithm in Section 11.1 of [GS '08] which demonstrates how to transform PPE equations such that GS can prove about them in zero-knowledge.
[ ] Implement a helper method for the prover which follows the aformentioned algorithm; provided some (P_i, Q_i) for which t_T = Π e(P_i, Q_i) for each PPE equation, attempts to automatically convert all PPE equations into zero-knowledge by adding more MSMEG2 equations and variables as described.
[ ] Implement a helper method for the prover which, given some Statement (i.e. Vec of Equation), determines whether it is already in zero-knowledge: check that all PPEs have a target of 1 and that all of the constants are paired with a variable that are blinded in a MSMEG2 equation
(n.b. I'm not sure how much trust a user should place one or both of these, so this might fall into wontfix)
Recall the algorithm in Section 11.1 of [GS '08] which demonstrates how to transform PPE equations such that GS can prove about them in zero-knowledge.
(P_i, Q_i)for whicht_T = Π e(P_i, Q_i)for each PPE equation, attempts to automatically convert all PPE equations into zero-knowledge by adding more MSMEG2 equations and variables as described.Statement(i.e.VecofEquation), determines whether it is already in zero-knowledge: check that all PPEs have a target of 1 and that all of the constants are paired with a variable that are blinded in a MSMEG2 equation(n.b. I'm not sure how much trust a user should place one or both of these, so this might fall into
wontfix)