From 499d2d07bfdb6bc89a87f333a9011545f9f21f1e Mon Sep 17 00:00:00 2001
From: wborgeaud <williamborgeaud@gmail.com>
Date: Tue, 14 Jun 2022 16:30:34 +0200
Subject: [PATCH] Minor

---
 evm/src/cross_table_lookup.rs     | 2 +-
 plonky2/src/gadgets/split_base.rs | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/evm/src/cross_table_lookup.rs b/evm/src/cross_table_lookup.rs
index ef9ab489..8a1722cc 100644
--- a/evm/src/cross_table_lookup.rs
+++ b/evm/src/cross_table_lookup.rs
@@ -46,7 +46,7 @@ impl<F: Field> Column<F> {
         debug_assert_eq!(
             v.iter().map(|(c, _)| c).unique().count(),
             v.len(),
-            "Duplicate filter columns."
+            "Duplicate columns."
         );
         Self::LinearCombination(v)
     }
diff --git a/plonky2/src/gadgets/split_base.rs b/plonky2/src/gadgets/split_base.rs
index 8cb113c4..5ceede66 100644
--- a/plonky2/src/gadgets/split_base.rs
+++ b/plonky2/src/gadgets/split_base.rs
@@ -30,7 +30,7 @@ impl<F: RichField + Extendable<D>, const D: usize> CircuitBuilder<F, D> {
 
     /// Takes an iterator of bits `(b_i)` and returns `sum b_i * 2^i`, i.e.,
     /// the number with little-endian bit representation given by `bits`.
-    pub fn le_sum(&mut self, bits: impl Iterator<Item = impl Borrow<BoolTarget>>) -> Target {
+    pub(crate) fn le_sum(&mut self, bits: impl Iterator<Item = impl Borrow<BoolTarget>>) -> Target {
         let bits = bits.map(|b| *b.borrow()).collect_vec();
         let num_bits = bits.len();
         if num_bits == 0 {