remove requirements on _pairing_ and `ark-poly-commit`

changelog

• remove ark-poly-commit from the dependencies
• remove the old setup.rs
• add temporary foo.rs which define (some details are ommited for brevity)
  • struct Powers<F, G>
  • struct Commitment<F, G>
  • fn build_powers<F, G>(...) -> Powers<F, G>
  • fn commit<F, G, P>(powers: &Powers<F, G>, polynomial: &P) -> Commitment<F, G>
  • tests
• foo.rs is then renamed to setup.rs
• two new KomodoError variants have been created to replace ark_poly_commit::Error
  • DegreeIsZero
  • TooFewPowersInTrustedSetup(usize, usize)
• finally, all the past mentions to E: Pairing and setup::random have been replaced with F, G and setup::build_powers respectively

benches/linalg.rs

-use ark_bls12_381::Bls12_381;
-use ark_ec::pairing::Pairing;
+use ark_bls12_381::Fr;
+use ark_ff::PrimeField;
 use criterion::{black_box, criterion_group, criterion_main, Criterion};
 
 use komodo::linalg::Matrix;
 
-fn inverse_template<E: Pairing>(c: &mut Criterion, n: usize) {
-    let matrix = Matrix::<E::ScalarField>::random(n, n);
+fn inverse_template<F: PrimeField>(c: &mut Criterion, n: usize) {
+    let matrix = Matrix::<F>::random(n, n);
 
     c.bench_function(
-        &format!("inverse {}x{} on {}", n, n, std::any::type_name::<E>()),
+        &format!("inverse {}x{} on {}", n, n, std::any::type_name::<F>()),
         |b| b.iter(|| matrix.invert().unwrap()),
     );
 }
 
 fn inverse(c: &mut Criterion) {
     for n in [10, 15, 20, 30, 40, 60, 80, 120, 160, 240, 320] {
-        inverse_template::<Bls12_381>(c, black_box(n));
+        inverse_template::<Fr>(c, black_box(n));
     }
 }
 
-fn transpose_template<E: Pairing>(c: &mut Criterion, n: usize) {
-    let matrix = Matrix::<E::ScalarField>::random(n, n);
+fn transpose_template<F: PrimeField>(c: &mut Criterion, n: usize) {
+    let matrix = Matrix::<F>::random(n, n);
 
     c.bench_function(
-        &format!("transpose {}x{} on {}", n, n, std::any::type_name::<E>()),
+        &format!("transpose {}x{} on {}", n, n, std::any::type_name::<F>()),
         |b| b.iter(|| matrix.transpose()),
     );
 }
 
 fn transpose(c: &mut Criterion) {
     for n in [10, 15, 20, 30, 40, 60, 80, 120, 160, 240, 320] {
-        transpose_template::<Bls12_381>(c, black_box(n));
+        transpose_template::<Fr>(c, black_box(n));
     }
 }
 
-fn mul_template<E: Pairing>(c: &mut Criterion, n: usize) {
-    let mat_a = Matrix::<E::ScalarField>::random(n, n);
-    let mat_b = Matrix::<E::ScalarField>::random(n, n);
+fn mul_template<F: PrimeField>(c: &mut Criterion, n: usize) {
+    let mat_a = Matrix::<F>::random(n, n);
+    let mat_b = Matrix::<F>::random(n, n);
 
     c.bench_function(
-        &format!("mul {}x{} on {}", n, n, std::any::type_name::<E>()),
+        &format!("mul {}x{} on {}", n, n, std::any::type_name::<F>()),
         |b| b.iter(|| mat_a.mul(&mat_b)),
     );
 }
 
 fn mul(c: &mut Criterion) {
     for n in [10, 15, 20, 30, 40, 60, 80, 120, 160, 240, 320] {
-        mul_template::<Bls12_381>(c, black_box(n));
+        mul_template::<Fr>(c, black_box(n));
     }
 }