Merge pull request #11 from AleoHQ/feat/circuits-int64

Gadgets for signed and unsigned integers

.circleci/config.yml

@@ -107,18 +107,32 @@ jobs:
 
   circuits:
     docker:
-      - image: cimg/rust:1.56.1
+      - image: cimg/rust:1.59
     resource_class: 2xlarge
+    parallelism: 50
     steps:
       - checkout
       - setup_environment:
           cache_key: snarkvm-circuits-cache
+      - run_parallel:
+          workspace_member: circuits
+      - clear_environment:
+          cache_key: snarkvm-circuits-cache
+
+  circuits-environment:
+    docker:
+      - image: cimg/rust:1.59
+    resource_class: 2xlarge
+    steps:
+      - checkout
+      - setup_environment:
+          cache_key: snarkvm-circuits-environment-cache
       - run:
           name: Build and run tests
           no_output_timeout: 35m
-          command: cd circuits && RUST_MIN_STACK=67108864 cargo test
+          command: cd circuits/environment && RUST_MIN_STACK=67108864 cargo test
       - clear_environment:
-          cache_key: snarkvm-circuits-cache
+          cache_key: snarkvm-circuits-environment-cache
 
   curves:
     docker:
@@ -262,6 +276,7 @@ workflows:
       - integration-testnet2
       - algorithms
       - circuits
+      - circuits-environment
       - curves
       - derives
       - dpc

.integration/Cargo.toml

@@ -43,7 +43,7 @@ version = "0.7.5"
 default-features = false
 
 [dependencies.aleo-std]
-version = "0.1.10"
+version = "0.1.12"
 optional = true
 
 [dependencies.anyhow]

Cargo.toml

@@ -21,6 +21,7 @@ edition = "2021"
 members = [
   "algorithms",
   "circuits",
+  "circuits/environment",
   "curves",
   "derives", # excluded from [features], for internal use primarily
   "dpc",

algorithms/Cargo.toml

@@ -103,7 +103,7 @@ version = "0.7.5"
 default-features = false
 
 [dependencies.aleo-std]
-version = "0.1.10"
+version = "0.1.12"
 
 [dependencies.anyhow]
 version = "1.0"

algorithms/src/polycommit/data_structures/polynomial.rs

@@ -22,13 +22,17 @@ use crate::fft::{
     Evaluations as EvaluationsOnDomain,
     SparsePolynomial,
 };
-use hashbrown::HashMap;
-#[cfg(feature = "parallel")]
-use rayon::prelude::*;
 use snarkvm_fields::{Field, PrimeField};
 use snarkvm_utilities::{cfg_iter, cfg_iter_mut, CanonicalDeserialize, CanonicalSerialize};
+
+use hashbrown::HashMap;
 use std::borrow::Cow;
 
+#[cfg(not(feature = "parallel"))]
+use itertools::Itertools;
+#[cfg(feature = "parallel")]
+use rayon::prelude::*;
+
 /// A polynomial along with information about its degree bound (if any), and the
 /// maximum number of queries that will be made to it. This latter number determines
 /// the amount of protection that will be provided to a commitment for this polynomial.

algorithms/src/snark/marlin/ahp/ahp.rs

@@ -415,9 +415,12 @@ impl<F: PrimeField> UnnormalizedBivariateLagrangePoly<F> for EvaluationDomain<F>
         x: F,
         domain: &EvaluationDomain<F>,
     ) -> Vec<F> {
+        use snarkvm_utilities::{cfg_iter, cfg_iter_mut};
+
+        #[cfg(not(feature = "parallel"))]
+        use itertools::Itertools;
         #[cfg(feature = "parallel")]
         use rayon::prelude::*;
-        use snarkvm_utilities::{cfg_iter, cfg_iter_mut};
 
         let vanish_x = self.evaluate_vanishing_polynomial(x);
         let elements = domain.elements().collect::<Vec<_>>();