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
Copy file name to clipboardExpand all lines: report/src/sections/04-Approach.tex
+1-1Lines changed: 1 addition & 1 deletion
Original file line number
Diff line number
Diff line change
@@ -270,7 +270,7 @@ \subsubsection{CAAUdleproofs}
270
270
CAAUrdleproofs introduced a slight difference on this topic in regard to the~\glspl{ipa}, \texttt{sameperm} and \texttt{same multiscalar}.
271
271
In each recursive round, both the folded vectors and the commitments are being multiplied by verification scalars, $\gamma_j$.
272
272
To keep track of which elements of the vectors are multiplied by each $\gamma_j$, a function called \texttt{get\_verification\_scalars\_bitstring} is used.
273
-
The output of this function is a list of length $\ell$, each element with a list corresponding to the rounds in which $gamma_j$ was multiplied to the element.
273
+
The output of this function is a list of length $\ell$, each element with a list corresponding to the rounds in which $\gamma_j$ was multiplied to the element.
274
274
Curdleproofs' implementation is simpler than CAAUrdleproofs' in this case.
275
275
As Curdleproofs works on powers of two, it is always the right half of the vectors in each round that are multiplied by the challenge.
0 commit comments