Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update Links in Documentation #153

Open
wants to merge 3 commits into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/boolean/cmp.rs
Original file line number Diff line number Diff line change
Expand Up @@ -16,7 +16,7 @@ impl<F: PrimeField> CmpGadget<F> for Boolean<F> {
}

impl<F: PrimeField> Boolean<F> {
/// Enforces that `bits`, when interpreted as a integer, is less than
/// Enforces that `bits`, when interpreted as an integer, is less than
/// `F::characteristic()`, That is, interpret bits as a little-endian
/// integer, and enforce that this integer is "in the field Z_p", where
/// `p = F::characteristic()` .
Expand Down
2 changes: 1 addition & 1 deletion src/fields/mod.rs
Original file line number Diff line number Diff line change
Expand Up @@ -218,7 +218,7 @@ pub trait FieldVar<F: Field, ConstraintF: PrimeField>:
Ok(res)
}

/// Computes `self^S`, where S is interpreted as an little-endian
/// Computes `self^S`, where S is interpreted as a little-endian
/// u64-decomposition of an integer.
fn pow_by_constant<S: AsRef<[u64]>>(&self, exp: S) -> Result<Self, SynthesisError> {
let mut res = Self::one();
Expand Down
6 changes: 3 additions & 3 deletions src/groups/curves/short_weierstrass/mod.rs
Original file line number Diff line number Diff line change
Expand Up @@ -247,7 +247,7 @@ where
// step(s) of the algorithm
//
// Adapted from code in
// https://github.com/RustCrypto/elliptic-curves/blob/master/p256/src/arithmetic/projective.rs
// https://github.com/RustCrypto/elliptic-curves/blob/master/p256/tests/projective.rs
let three_b = P::COEFF_B.double() + &P::COEFF_B;
let (x1, y1, z1) = (&self.x, &self.y, &self.z);
let (x2, y2) = (&other.x, &other.y);
Expand Down Expand Up @@ -460,7 +460,7 @@ where
// step(s) of the algorithm
//
// Adapted from code in
// https://github.com/RustCrypto/elliptic-curves/blob/master/p256/src/arithmetic/projective.rs
// https://github.com/RustCrypto/elliptic-curves/blob/master/p256/tests/projective.rs
let three_b = P::COEFF_B.double() + &P::COEFF_B;

let xx = self.x.square()?; // 1
Expand Down Expand Up @@ -637,7 +637,7 @@ impl_bounded_ops!(
// step(s) of the algorithm
//
// Adapted from code in
// https://github.com/RustCrypto/elliptic-curves/blob/master/p256/src/arithmetic/projective.rs
// https://github.com/RustCrypto/elliptic-curves/blob/master/p256/tests/projective.rs
let three_b = P::COEFF_B.double() + &P::COEFF_B;
let (x1, y1, z1) = (&this.x, &this.y, &this.z);
let (x2, y2, z2) = (&other.x, &other.y, &other.z);
Expand Down