From 3049a53843201971eeb03c30b84e2805be4cfc76 Mon Sep 17 00:00:00 2001 From: Daira Hopwood Date: Wed, 15 Aug 2018 15:40:35 +0100 Subject: [PATCH] Remove a resolved TODO. Signed-off-by: Daira Hopwood --- protocol/protocol.tex | 4 ---- 1 file changed, 4 deletions(-) diff --git a/protocol/protocol.tex b/protocol/protocol.tex index 1cbcf8b6..5f3a181f 100644 --- a/protocol/protocol.tex +++ b/protocol/protocol.tex @@ -10739,7 +10739,6 @@ This can be implemented in one constraint: \begin{pnotes} \item The bit length $n$ is not limited by the field element size. - \item Since the constraint has only a trivial multiplication, it is possible to eliminate it by merging it into the boolean constraint 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 per unpacking operation), and so we do not use it for the \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 possible representations of $a \typecolon \GF{\ParamS{r}}$ as a sequence of $255$ bits, corresponding to $\ItoLEBSPOf{255}{a}$ and