Skip to content

Commit 111b642

Browse files
committed
Update dependencies
1 parent 1a9e4b6 commit 111b642

File tree

4 files changed

+10
-12
lines changed

4 files changed

+10
-12
lines changed

Cargo.toml

Lines changed: 7 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -12,17 +12,16 @@ keywords = ["cryptography", "ristretto", "zero-knowledge", "bulletproofs"]
1212
description = "A pure-Rust implementation of Bulletproofs using Ristretto"
1313

1414
[dependencies]
15-
curve25519-dalek = { version = "0.20", features = ["serde"] }
16-
subtle = "1"
17-
sha3 = "0.7"
18-
digest = "0.7"
19-
rand = "0.5.0-pre.2"
20-
byteorder = "1.2.1"
15+
curve25519-dalek = { version = "1.0.0-pre.0", features = ["serde"] }
16+
subtle = "2.0.0-pre.0"
17+
sha3 = "0.8"
18+
digest = "0.8"
19+
rand = "0.5"
20+
byteorder = "1"
2121
serde = "1"
2222
serde_derive = "1"
23-
tiny-keccak = "1.4.1"
2423
failure = "0.1"
25-
merlin = "0.4"
24+
merlin = "1.0.0-pre.0"
2625

2726
[dev-dependencies]
2827
hex = "0.3"

src/generators.rs

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -51,8 +51,8 @@ impl GeneratorsChain {
5151
/// Creates a chain of generators, determined by the hash of `label`.
5252
fn new(label: &[u8]) -> Self {
5353
let mut shake = Shake256::default();
54-
shake.process(b"GeneratorsChain");
55-
shake.process(label);
54+
shake.input(b"GeneratorsChain");
55+
shake.input(label);
5656

5757
GeneratorsChain {
5858
reader: shake.xof_result(),

src/lib.rs

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -18,7 +18,6 @@ extern crate merlin;
1818
extern crate rand;
1919
extern crate sha3;
2020
extern crate subtle;
21-
extern crate tiny_keccak;
2221
#[macro_use]
2322
extern crate serde_derive;
2423
extern crate serde;

src/range_proof/party.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -71,7 +71,7 @@ impl<'a> PartyAwaitingPosition<'a> {
7171
// Compute A = <a_L, G> + <a_R, H> + a_blinding * B_blinding
7272
let mut A = self.pc_gens.B_blinding * a_blinding;
7373

74-
use subtle::{Choice, ConditionallyAssignable};
74+
use subtle::{Choice, ConditionallySelectable};
7575
let mut i = 0;
7676
for (G_i, H_i) in bp_share.G(self.n).zip(bp_share.H(self.n)) {
7777
// If v_i = 0, we add a_L[i] * G[i] + a_R[i] * H[i] = - H[i]

0 commit comments

Comments
 (0)