Update sapling-crypto crate to use ff crate
This commit is contained in:
parent
76cd0d92bb
commit
22ccd1bceb
|
@ -365,6 +365,7 @@ dependencies = [
|
|||
"blake2-rfc 0.2.18 (git+https://github.com/gtank/blake2-rfc?rev=7a5b5fc99ae483a0043db7547fb79a6fa44b88a9)",
|
||||
"byteorder 1.2.2 (registry+https://github.com/rust-lang/crates.io-index)",
|
||||
"digest 0.7.2 (registry+https://github.com/rust-lang/crates.io-index)",
|
||||
"ff 0.4.0 (registry+https://github.com/rust-lang/crates.io-index)",
|
||||
"hex-literal 0.1.1 (registry+https://github.com/rust-lang/crates.io-index)",
|
||||
"pairing 0.14.2",
|
||||
"rand 0.4.2 (registry+https://github.com/rust-lang/crates.io-index)",
|
||||
|
|
|
@ -14,6 +14,7 @@ features = ["expose-arith"]
|
|||
|
||||
[dependencies]
|
||||
bellman = { path = "../bellman" }
|
||||
ff = "0.4"
|
||||
rand = "0.4"
|
||||
digest = "0.7"
|
||||
byteorder = "1"
|
||||
|
|
|
@ -1,9 +1,5 @@
|
|||
use pairing::{
|
||||
Engine,
|
||||
Field,
|
||||
PrimeField,
|
||||
BitIterator
|
||||
};
|
||||
use ff::{BitIterator, Field, PrimeField};
|
||||
use pairing::Engine;
|
||||
|
||||
use bellman::{
|
||||
ConstraintSystem,
|
||||
|
@ -806,8 +802,8 @@ impl From<AllocatedBit> for Boolean {
|
|||
#[cfg(test)]
|
||||
mod test {
|
||||
use bellman::{ConstraintSystem};
|
||||
use ff::{Field, PrimeField};
|
||||
use pairing::bls12_381::{Bls12, Fr};
|
||||
use pairing::{Field, PrimeField};
|
||||
use ::circuit::test::*;
|
||||
use super::{
|
||||
AllocatedBit,
|
||||
|
|
|
@ -1,7 +1,5 @@
|
|||
use pairing::{
|
||||
Engine,
|
||||
Field
|
||||
};
|
||||
use ff::Field;
|
||||
use pairing::Engine;
|
||||
|
||||
use bellman::{
|
||||
SynthesisError,
|
||||
|
@ -751,8 +749,8 @@ impl<E: JubjubEngine> MontgomeryPoint<E> {
|
|||
mod test {
|
||||
use bellman::{ConstraintSystem};
|
||||
use rand::{XorShiftRng, SeedableRng, Rand, Rng};
|
||||
use ff::{BitIterator, Field, PrimeField};
|
||||
use pairing::bls12_381::{Bls12, Fr};
|
||||
use pairing::{BitIterator, Field, PrimeField};
|
||||
use ::circuit::test::*;
|
||||
use ::jubjub::{
|
||||
montgomery,
|
||||
|
|
|
@ -1,4 +1,6 @@
|
|||
use pairing::{Engine, Field};
|
||||
use ff::Field;
|
||||
use pairing::Engine;
|
||||
|
||||
use super::*;
|
||||
use super::num::{
|
||||
AllocatedNum,
|
||||
|
|
|
@ -1,8 +1,5 @@
|
|||
use pairing::{
|
||||
Engine,
|
||||
Field,
|
||||
PrimeField
|
||||
};
|
||||
use ff::{Field, PrimeField};
|
||||
use pairing::Engine;
|
||||
|
||||
use bellman::{
|
||||
SynthesisError,
|
||||
|
|
|
@ -1,4 +1,5 @@
|
|||
use pairing::{Engine, Field, PrimeField};
|
||||
use ff::{Field, PrimeField};
|
||||
use pairing::Engine;
|
||||
use bellman::{ConstraintSystem, SynthesisError};
|
||||
use super::boolean::{Boolean};
|
||||
use super::num::Num;
|
||||
|
|
|
@ -1,10 +1,5 @@
|
|||
use pairing::{
|
||||
Engine,
|
||||
Field,
|
||||
PrimeField,
|
||||
PrimeFieldRepr,
|
||||
BitIterator
|
||||
};
|
||||
use ff::{BitIterator, Field, PrimeField, PrimeFieldRepr};
|
||||
use pairing::Engine;
|
||||
|
||||
use bellman::{
|
||||
SynthesisError,
|
||||
|
@ -462,8 +457,8 @@ impl<E: Engine> Num<E> {
|
|||
mod test {
|
||||
use rand::{SeedableRng, Rand, Rng, XorShiftRng};
|
||||
use bellman::{ConstraintSystem};
|
||||
use ff::{BitIterator, Field, PrimeField};
|
||||
use pairing::bls12_381::{Bls12, Fr};
|
||||
use pairing::{Field, PrimeField, BitIterator};
|
||||
use ::circuit::test::*;
|
||||
use super::{AllocatedNum, Boolean};
|
||||
|
||||
|
|
|
@ -116,8 +116,8 @@ mod test {
|
|||
use super::*;
|
||||
use ::circuit::test::*;
|
||||
use ::circuit::boolean::{Boolean, AllocatedBit};
|
||||
use ff::PrimeField;
|
||||
use pairing::bls12_381::{Bls12, Fr};
|
||||
use pairing::PrimeField;
|
||||
|
||||
#[test]
|
||||
fn test_pedersen_hash_constraints() {
|
||||
|
|
|
@ -1,8 +1,4 @@
|
|||
use pairing::{
|
||||
PrimeField,
|
||||
PrimeFieldRepr,
|
||||
Field,
|
||||
};
|
||||
use ff::{Field, PrimeField, PrimeFieldRepr};
|
||||
|
||||
use bellman::{
|
||||
SynthesisError,
|
||||
|
@ -602,7 +598,7 @@ impl<'a, E: JubjubEngine> Circuit<E> for Output<'a, E> {
|
|||
|
||||
#[test]
|
||||
fn test_input_circuit_with_bls12_381() {
|
||||
use pairing::{Field, BitIterator};
|
||||
use ff::{BitIterator, Field};
|
||||
use pairing::bls12_381::*;
|
||||
use rand::{SeedableRng, Rng, XorShiftRng};
|
||||
use ::circuit::test::*;
|
||||
|
@ -734,7 +730,7 @@ fn test_input_circuit_with_bls12_381() {
|
|||
|
||||
#[test]
|
||||
fn test_output_circuit_with_bls12_381() {
|
||||
use pairing::{Field};
|
||||
use ff::Field;
|
||||
use pairing::bls12_381::*;
|
||||
use rand::{SeedableRng, Rng, XorShiftRng};
|
||||
use ::circuit::test::*;
|
||||
|
|
|
@ -1,4 +1,5 @@
|
|||
use pairing::{Engine, Field};
|
||||
use ff::Field;
|
||||
use pairing::Engine;
|
||||
use bellman::{ConstraintSystem, SynthesisError, Circuit, LinearCombination};
|
||||
use circuit::boolean::{
|
||||
AllocatedBit,
|
||||
|
|
|
@ -1,9 +1,5 @@
|
|||
use pairing::{
|
||||
Engine,
|
||||
Field,
|
||||
PrimeField,
|
||||
PrimeFieldRepr
|
||||
};
|
||||
use ff::{Field, PrimeField, PrimeFieldRepr};
|
||||
use pairing::Engine;
|
||||
|
||||
use bellman::{
|
||||
LinearCombination,
|
||||
|
@ -445,8 +441,8 @@ impl<E: Engine> ConstraintSystem<E> for TestConstraintSystem<E> {
|
|||
|
||||
#[test]
|
||||
fn test_cs() {
|
||||
use ff::PrimeField;
|
||||
use pairing::bls12_381::{Bls12, Fr};
|
||||
use pairing::PrimeField;
|
||||
|
||||
let mut cs = TestConstraintSystem::<Bls12>::new();
|
||||
assert!(cs.is_satisfied());
|
||||
|
|
|
@ -1,8 +1,5 @@
|
|||
use pairing::{
|
||||
Engine,
|
||||
Field,
|
||||
PrimeField
|
||||
};
|
||||
use ff::{Field, PrimeField};
|
||||
use pairing::Engine;
|
||||
|
||||
use bellman::{
|
||||
SynthesisError,
|
||||
|
@ -415,8 +412,8 @@ mod test {
|
|||
use rand::{XorShiftRng, SeedableRng, Rng};
|
||||
use ::circuit::boolean::{Boolean};
|
||||
use super::{UInt32};
|
||||
use ff::Field;
|
||||
use pairing::bls12_381::{Bls12};
|
||||
use pairing::{Field};
|
||||
use ::circuit::test::*;
|
||||
use bellman::{ConstraintSystem};
|
||||
use circuit::multieq::MultiEq;
|
||||
|
|
|
@ -4,7 +4,7 @@ use jubjub::{
|
|||
edwards
|
||||
};
|
||||
|
||||
use pairing::{
|
||||
use ff::{
|
||||
PrimeField
|
||||
};
|
||||
|
||||
|
|
|
@ -1,10 +1,4 @@
|
|||
use pairing::{
|
||||
Field,
|
||||
SqrtField,
|
||||
PrimeField,
|
||||
PrimeFieldRepr,
|
||||
BitIterator
|
||||
};
|
||||
use ff::{BitIterator, Field, PrimeField, PrimeFieldRepr, SqrtField};
|
||||
|
||||
use super::{
|
||||
JubjubEngine,
|
||||
|
|
|
@ -1,7 +1,9 @@
|
|||
use byteorder::{ByteOrder, LittleEndian};
|
||||
use pairing::{BitIterator, Field, PrimeField, SqrtField, PrimeFieldRepr, PrimeFieldDecodingError, LegendreSymbol};
|
||||
use pairing::LegendreSymbol::*;
|
||||
use pairing::{adc, sbb, mac_with_carry};
|
||||
use ff::{
|
||||
adc, mac_with_carry, sbb, BitIterator, Field,
|
||||
LegendreSymbol::{self, *},
|
||||
PrimeField, PrimeFieldDecodingError, PrimeFieldRepr, SqrtField,
|
||||
};
|
||||
|
||||
use super::ToUniform;
|
||||
|
||||
|
|
|
@ -17,12 +17,8 @@
|
|||
//! the Montgomery curve forms a group isomorphism, allowing points
|
||||
//! to be freely converted between the two forms.
|
||||
|
||||
use pairing::{
|
||||
Engine,
|
||||
Field,
|
||||
PrimeField,
|
||||
SqrtField
|
||||
};
|
||||
use ff::{Field, PrimeField, SqrtField};
|
||||
use pairing::Engine;
|
||||
|
||||
use group_hash::group_hash;
|
||||
|
||||
|
|
|
@ -1,10 +1,4 @@
|
|||
use pairing::{
|
||||
Field,
|
||||
SqrtField,
|
||||
PrimeField,
|
||||
PrimeFieldRepr,
|
||||
BitIterator
|
||||
};
|
||||
use ff::{BitIterator, Field, PrimeField, PrimeFieldRepr, SqrtField};
|
||||
|
||||
use super::{
|
||||
JubjubEngine,
|
||||
|
|
|
@ -6,7 +6,7 @@ use super::{
|
|||
edwards
|
||||
};
|
||||
|
||||
use pairing::{
|
||||
use ff::{
|
||||
Field,
|
||||
PrimeField,
|
||||
PrimeFieldRepr,
|
||||
|
|
|
@ -2,6 +2,7 @@ extern crate pairing;
|
|||
extern crate bellman;
|
||||
extern crate blake2_rfc;
|
||||
extern crate digest;
|
||||
extern crate ff;
|
||||
extern crate rand;
|
||||
extern crate byteorder;
|
||||
|
||||
|
|
|
@ -1,5 +1,5 @@
|
|||
use ff::{Field, PrimeField, PrimeFieldRepr};
|
||||
use jubjub::*;
|
||||
use pairing::*;
|
||||
|
||||
#[derive(Copy, Clone)]
|
||||
pub enum Personalization {
|
||||
|
|
|
@ -1,8 +1,4 @@
|
|||
use pairing::{
|
||||
Field,
|
||||
PrimeField,
|
||||
PrimeFieldRepr
|
||||
};
|
||||
use ff::{Field, PrimeField, PrimeFieldRepr};
|
||||
|
||||
use constants;
|
||||
|
||||
|
|
|
@ -1,7 +1,7 @@
|
|||
//! Implementation of RedJubjub, a specialization of RedDSA to the Jubjub curve.
|
||||
//! See section 5.4.6 of the Sapling protocol specification.
|
||||
|
||||
use pairing::{Field, PrimeField, PrimeFieldRepr};
|
||||
use ff::{Field, PrimeField, PrimeFieldRepr};
|
||||
use rand::{Rng, Rand};
|
||||
use std::io::{self, Read, Write};
|
||||
|
||||
|
|
Loading…
Reference in New Issue