From 6fff9363c6bf77ccbd724252175f5ba82d419704 Mon Sep 17 00:00:00 2001
From: wborgeaud <williamborgeaud@gmail.com>
Date: Wed, 21 Jul 2021 20:06:29 +0200
Subject: [PATCH] Use `mul_many`

---
 src/fri/recursive_verifier.rs | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/src/fri/recursive_verifier.rs b/src/fri/recursive_verifier.rs
index 206a87e5..c37fe430 100644
--- a/src/fri/recursive_verifier.rs
+++ b/src/fri/recursive_verifier.rs
@@ -40,8 +40,7 @@ impl<F: Extendable<D>, const D: usize> CircuitBuilder<F, D> {
         // TODO: Once the exponentiation gate lands, we won't need the bits and will be able to compute
         // `g^(arity-rev_old_x_index)` directly.
         let start = self.exp_from_complement_bits(gt, &old_x_index_bits);
-        let start = self.mul(start, x);
-        let start = self.mul(start, gt);
+        let start = self.mul_many(&[start, gt, x]);
 
         // The answer is gotten by interpolating {(x*g^i, P(x*g^i))} and evaluating at beta.
         let points = g