barretenberg
barretenberg copied to clipboard
AztecProtocol
I'm told that we don't actually take advantage of the short scalars that we produce.
The verifier's folding work is $\phi' = L_0(\gamma)\phi + \sum_{i=1}^{k}L_i(\gamma)\phi_i$. In the special case where $k=1$, we have $L_0(\gamma) = 1-\gamma$ and $L_1(\gamma)=\gamma$, so the verifier's folding work is the...
We currently have no way of catching regressions of memory utilization.
The method `commit_structured_with_nonzero_complement` involves making a full copy of the srs points corresponding to the complement of the "active" region of the execution trace. These points are then summed into...
The `MsmSorter` class was designed to facilitate efficient commitment to polynomials with many repeated coefficients. The idea was to sort the scalars/points by scalar, sum the points sharing a common...
We can do recursive verification without the initialization step, but perhaps we will want that again in the future.