From 3af219b701f6b601fa2670718b311dcff0932821 Mon Sep 17 00:00:00 2001 From: Reuben Thomas Date: Thu, 8 Dec 2022 20:28:29 +0000 Subject: [PATCH] README: fix a typo --- README.md | 2 +- README.tex.md | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index a338936..500e057 100644 --- a/README.md +++ b/README.md @@ -12,7 +12,7 @@ Bulletproofs are short zero-knowledge arguments of knowledge that do not require a trusted setup. Argument systems are proof systems with computational soundness. -Bulletproofs are suitable for proving statements on committed values, such as range proofs, verifiable suffles, arithmetic circuits, etc. +Bulletproofs are suitable for proving statements on committed values, such as range proofs, verifiable shuffles, arithmetic circuits, etc. They rely on the discrete logarithmic assumption and are made non-interactive using the Fiat-Shamir heuristic. diff --git a/README.tex.md b/README.tex.md index 55f35a0..9b8c1d5 100644 --- a/README.tex.md +++ b/README.tex.md @@ -10,7 +10,7 @@ Bulletproofs are short zero-knowledge arguments of knowledge that do not require a trusted setup. Argument systems are proof systems with computational soundness. -Bulletproofs are suitable for proving statements on committed values, such as range proofs, verifiable suffles, arithmetic circuits, etc. +Bulletproofs are suitable for proving statements on committed values, such as range proofs, verifiable shuffles, arithmetic circuits, etc. They rely on the discrete logarithmic assumption and are made non-interactive using the Fiat-Shamir heuristic.