You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
- Establish API in purely virtual class
- This is just a first pass. I will continue to work on this before
showing dev rel and others to get buy-in.
- Implement some API functions for ClientIVC: prove, verify,
prove_and_verify
- Support for constructing CIVC proof for input a single circuit
- This is interpreted as a "compiletime stack"
- Produces ECCVM and Translator proofs from dummy/empty data; future
optimization could avoid.
- Add `one_circuit` to CIVC to encode whether the MH part of the CIVC
proof should be a hiding circuit (which takes a folding proof) or a
proof for the single circuit.
- Run almost all ACIR tests against ClientIVC
- Previously only ran MegaHonk tests, which are not totally meaningful.
- Four are skipped because they fail. These failures are expected to be
superficial (see
AztecProtocol/barretenberg#1164 and the
references to it in the PR's new code).
- fold_and_verify and mega honk flows go away in bb, but remain until
bb.js alignment.
- Delete large log file that should not be track (accounts for big
negative diff).
Copy file name to clipboardexpand all lines: barretenberg/cpp/docs/src/sumcheck-outline.md
+2-2
Original file line number
Diff line number
Diff line change
@@ -195,9 +195,9 @@ Observe that \f$ G \f$ has several important properties
195
195
- The coefficients of \f$ G \f$ are independent and uniformly distributed.
196
196
- Evaluations of \f$ G \f$ at \f$ \vec \ell \in \{0,1\}^d\f$ and related Sumcheck Round Univariates are efficiently computable.
197
197
198
-
The first two properties imply that the evaluations of Sumcheck Round Univariates for \f$G\f$ are independent and uniformly distributed. We call them Libra Round Univarites.
198
+
The first two properties imply that the evaluations of Sumcheck Round Univariates for \f$G\f$ are independent and uniformly distributed. We call them Libra Round Univariates.
199
199
200
-
Consider Round Univariates for \f$ \tilde{F} + \texttt{libra_challenge}\cdot G\f$ which are the sums of the Sumcheck Round Univariates for \f$ \tilde{F} \f$ and Libra Round Univarites multiplied by the challenge.
200
+
Consider Round Univariates for \f$ \tilde{F} + \texttt{libra_challenge}\cdot G\f$ which are the sums of the Sumcheck Round Univariates for \f$ \tilde{F} \f$ and Libra Round Univariates multiplied by the challenge.
201
201
The fact that the degrees of Libra Round Univariates are big enough (i.e. \f$ \tilde{D}\geq D \f$) and that their evaluations are random imply that the evaluations \f$ \tilde{S}^i(0),\ldots,\tilde{S}^i(\tilde D)\f$ defined in [Compute Round Univariates](#ComputeRoundUnivariates) are now masked by the evaluations of Libra Round Univariates. These evaluations are described explicitly [below](#LibraRoundUnivariates).
0 commit comments