From 79b0307b87f301bd863b02d1d395d5f7cf18d7ff Mon Sep 17 00:00:00 2001 From: therealyingtong Date: Thu, 27 May 2021 13:59:15 +0800 Subject: [PATCH] Formatting fixes Co-authored-by: Daira Hopwood --- book/src/design/circuit/gadgets/sinsemilla.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/book/src/design/circuit/gadgets/sinsemilla.md b/book/src/design/circuit/gadgets/sinsemilla.md index 7bdac269..be8da57b 100644 --- a/book/src/design/circuit/gadgets/sinsemilla.md +++ b/book/src/design/circuit/gadgets/sinsemilla.md @@ -23,7 +23,7 @@ $\textsf{Hash}(M)$: $A_{i+1} := [2] A_i + P[m_i] = (A_i + P[m_i]) + A_i$ return $A_{n+1}$ -Let $\textsf{ShortHash}(M)$ be the $x\text{-coordinate}$ of $\textsf{Hash}(M)$. (This assumes that mathbb{G}$ is a prime-order elliptic curve in short Weierstrass form, as is the case for Pallas and Vesta.) +Let $\textsf{ShortHash}(M)$ be the $x$-coordinate of $\textsf{Hash}(M)$. (This assumes that $\mathbb{G}$ is a prime-order elliptic curve in short Weierstrass form, as is the case for Pallas and Vesta.) ### Use as a commitment scheme Choose another generator $H$ independently of $Q$ and $P[0..2^k - 1]$. @@ -139,6 +139,7 @@ y_{A,i+1} &= (\lambda_{1,i+1} + \lambda_{2,i+1}) \cdot (x_{A,i+1} - (\lambda_{1, $$ * The degree of a lookup gate is 2 + the degree of the polynomial expression being looked up (after tuple compression). TODO check this. + A further optimization is to toggle the lookup expression on $q_{Sinsemilla1}.$ This removes the need to fill in unused cells with dummy values to pass the lookup argument. The optimized lookup argument would be: $$