zec
/
zips
mirror of https://github.com/zcash/zips.git
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Remove a resolved TODO. 

Signed-off-by: Daira Hopwood <daira@jacaranda.org>
This commit is contained in:
Daira Hopwood 2018-08-15 15:40:35 +01:00
parent 4d1cb63baf
commit 3049a53843
1 changed files with 0 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
protocol/protocol.tex
View File

@ -10739,7 +10739,6 @@ This can be implemented in one constraint:
\begin{pnotes} \begin{pnotes}
\item The bit length $n$ is not limited by the field element size. \item The bit length $n$ is not limited by the field element size.
\item Since the constraint has only a trivial multiplication, it is \item Since the constraint has only a trivial multiplication, it is
possible to eliminate it by merging it into the boolean constraint possible to eliminate it by merging it into the boolean constraint
of one of the output bits, expressing that bit as a linear of one of the output bits, expressing that bit as a linear
@ -10748,9 +10747,6 @@ This can be implemented in one constraint:
of the circuit implementation (for a saving of only one constraint of the circuit implementation (for a saving of only one constraint
per unpacking operation), and so we do not use it for the per unpacking operation), and so we do not use it for the
\Sapling circuit. \Sapling circuit.
\todo{Do we want to use it internally to the BLAKE2s implementation
where modularity is not significantly affected?}
\item In the case $n = 255$, for $a < 2^{255} - \ParamS{r}$ there are two \item In the case $n = 255$, for $a < 2^{255} - \ParamS{r}$ there are two
possible representations of $a \typecolon \GF{\ParamS{r}}$ as a possible representations of $a \typecolon \GF{\ParamS{r}}$ as a
sequence of $255$ bits, corresponding to $\ItoLEBSPOf{255}{a}$ and sequence of $255$ bits, corresponding to $\ItoLEBSPOf{255}{a}$ and