From 1d1e8aa6bd861a5023f7654bd6b1d6888d227e65 Mon Sep 17 00:00:00 2001
From: Marcella Hastings <marcellahastings@gmail.com>
Date: Wed, 21 Jun 2023 15:41:18 -0400
Subject: [PATCH] fix fmt bugs from rust update #313

---
 src/protocol.rs   |  2 +-
 src/zkp/piaffg.rs | 17 ++++++++---------
 2 files changed, 9 insertions(+), 10 deletions(-)

diff --git a/src/protocol.rs b/src/protocol.rs
index 87b4380a..6f327cc2 100644
--- a/src/protocol.rs
+++ b/src/protocol.rs
@@ -56,7 +56,7 @@ pub enum ProtocolType {
 /// all messages generated by participants of a sub-protocol session.
 /// for its [`Participant`]. This includes:
 /// 1. Initializing a session by calling [`Participant::initialize_message()`].
-///     The message returned from that function must be passed back to the
+///    The message returned from that function must be passed back to the
 /// [`Participant`] in order to begin the protocol execution.
 /// 2. Receiving messages sent by other participants, and passing
 /// them to the participant by calling
diff --git a/src/zkp/piaffg.rs b/src/zkp/piaffg.rs
index b964bbf2..f6f0524b 100644
--- a/src/zkp/piaffg.rs
+++ b/src/zkp/piaffg.rs
@@ -231,9 +231,8 @@ impl Proof2 for PiAffgProof {
         // `p`rover's or the `v`erifier's encryption key. The prover wants to
         // prove the following three claims:
         //
-        // 1. `C_v[z] ^ x · C_v[y] = D`, where `C_v[z]` is a public value
-        //    provided by the verifier and `D` is a public value computed by the
-        //    prover.
+        // 1. `C_v[z] ^ x · C_v[y] = D`, where `C_v[z]` is a public value provided by
+        //    the verifier and `D` is a public value computed by the prover.
         //
         // 2. `C_p[y] = Y`, where `Y` is a public value provided by the prover.
         //
@@ -246,14 +245,14 @@ impl Proof2 for PiAffgProof {
         // following three conditions, using a challenge value `e` produced by
         // using Fiat-Shamir:
         //
-        // 1. C_v[z] ^ (ɑ + e x) · C_v[β + e y] = A * D ^ e (note that if `D`
-        //    "encodes" `z x + y` this check will pass)
+        // 1. C_v[z] ^ (ɑ + e x) · C_v[β + e y] = A * D ^ e (note that if `D` "encodes"
+        //    `z x + y` this check will pass)
         //
-        // 2. g ^ (ɑ + e x) = B_x · X ^ e (note that if `X = g ^ x` this check
-        //    will pass)
+        // 2. g ^ (ɑ + e x) = B_x · X ^ e (note that if `X = g ^ x` this check will
+        //    pass)
         //
-        // 3. C_p[β + e y] = B_y · Y ^ e (note that if `Y = C_p[y]` this check
-        //    will pass)
+        // 3. C_p[β + e y] = B_y · Y ^ e (note that if `Y = C_p[y]` this check will
+        //    pass)
         //
         // This checks the main properties we are going for, however it doesn't
         // enforce yet that `ɑ + e x`, `β + e y`, etc. were computed correctly.