From 67955d043473bb45bc89d6fbd0cf187d4bbf0057 Mon Sep 17 00:00:00 2001 From: Brian Lawrence Date: Mon, 8 Jul 2024 14:49:48 -0700 Subject: [PATCH] Minor edits from Alex --- easy/main.typ | 5 +++-- easy/src/plonk.typ | 2 +- 2 files changed, 4 insertions(+), 3 deletions(-) diff --git a/easy/main.typ b/easy/main.typ index 1c0fa47..4e3d42e 100644 --- a/easy/main.typ +++ b/easy/main.typ @@ -18,8 +18,9 @@ #quote[ I can now prove to you that I have a message $M$ such that - $op("SHA")(M) = "0xa91af3ac..."$, without revealing $M$. - But not just for SHA. I can do this for any function you want. + $sha(M) = "0xa91af3ac..."$, without revealing $M$. + But not just for the hash function sha. + I can do this for any function you want. ] #toc diff --git a/easy/src/plonk.typ b/easy/src/plonk.typ index 3232110..d3ccdda 100644 --- a/easy/src/plonk.typ +++ b/easy/src/plonk.typ @@ -144,7 +144,7 @@ systems of quadratic equations of a very particular form: we get an "addition" gate $a_i + b_i = c_i,$ while if we set - $ ( q_(L,i), q_(R,i), q_(O,i), q_(M,i), q_(C,i)) = ( 1, 1, 0, -1, 0 ), $ + $ ( q_(L,i), q_(R,i), q_(O,i), q_(M,i), q_(C,i)) = ( 0, 0, -1, 1, 0 ), $ we get a "multiplication" gate $a_i b_i = c_i.$ Finally, if $q$ is any constant, then