remove InvalidBitSize limitations to allow one-hot vectors

Author: Cathie Yun

benches/range_proof.rs

@@ -13,7 +13,7 @@ use merlin::Transcript;
 use bulletproofs::RangeProof;
 use bulletproofs::{BulletproofGens, PedersenGens};
 
-static AGGREGATION_SIZES: [usize; 5] = [1024, 2048, 4096, 8192, 16384];
+static AGGREGATION_SIZES: [usize; 8] = [1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072];
 
 fn create_aggregated_rangeproof_helper(n: usize, c: &mut Criterion) {
     let label = format!("Aggregated {}-bit rangeproof creation", n);

src/range_proof/mod.rs

@@ -355,9 +355,9 @@ impl RangeProof {
 
         // First, replay the "interactive" protocol using the proof
         // data to recompute all challenges.
-        if !(n == 8 || n == 16 || n == 32 || n == 64) {
-            return Err(ProofError::InvalidBitsize);
-        }
+        // if !(n == 8 || n == 16 || n == 32 || n == 64) {
+        //     return Err(ProofError::InvalidBitsize);
+        // }
         if bp_gens.gens_capacity < n {
             return Err(ProofError::InvalidGeneratorsLength);
         }
@@ -688,6 +688,11 @@ mod tests {
         }
     }
 
+    #[test]
+    fn create_and_verify_n_1_m_1024() {
+        singleparty_create_and_verify_helper(1, 1024);
+    }
+
     #[test]
     fn create_and_verify_n_32_m_1() {
         singleparty_create_and_verify_helper(32, 1);

src/range_proof/party.rs

@@ -41,9 +41,9 @@ impl Party {
         v_blinding: Scalar,
         n: usize,
     ) -> Result<PartyAwaitingPosition<'a>, MPCError> {
-        if !(n == 8 || n == 16 || n == 32 || n == 64) {
-            return Err(MPCError::InvalidBitsize);
-        }
+        // if !(n == 8 || n == 16 || n == 32 || n == 64) {
+        //     return Err(MPCError::InvalidBitsize);
+        // }
         if bp_gens.gens_capacity < n {
             return Err(MPCError::InvalidGeneratorsLength);
         }