mirror of
https://github.com/serai-dex/serai.git
synced 2025-12-08 12:19:24 +00:00
Correct a couple years of accumulated typos
This commit is contained in:
@@ -1,7 +1,7 @@
|
||||
[package]
|
||||
name = "multiexp"
|
||||
version = "0.4.0"
|
||||
description = "Multiexponentation algorithms for ff/group"
|
||||
description = "Multiexponentiation algorithms for ff/group"
|
||||
license = "MIT"
|
||||
repository = "https://github.com/serai-dex/serai/tree/develop/crypto/multiexp"
|
||||
authors = ["Luke Parker <lukeparker5132@gmail.com>"]
|
||||
|
||||
@@ -2,7 +2,7 @@
|
||||
|
||||
A multiexp implementation for ff/group implementing Straus and Pippenger. A
|
||||
batch verification API is also available via the "batch" feature, which enables
|
||||
secure multiexponentation batch verification given a series of values which
|
||||
secure multiexponentiation batch verification given a series of values which
|
||||
should sum to the identity, identifying which doesn't via binary search if they
|
||||
don't.
|
||||
|
||||
|
||||
@@ -173,7 +173,7 @@ fn algorithm(len: usize) -> Algorithm {
|
||||
}
|
||||
}
|
||||
|
||||
/// Performs a multiexponentation, automatically selecting the optimal algorithm based on the
|
||||
/// Performs a multiexponentiation, automatically selecting the optimal algorithm based on the
|
||||
/// amount of pairs.
|
||||
pub fn multiexp<G: Group>(pairs: &[(G::Scalar, G)]) -> G
|
||||
where
|
||||
@@ -188,7 +188,7 @@ where
|
||||
}
|
||||
}
|
||||
|
||||
/// Performs a multiexponentation in variable time, automatically selecting the optimal algorithm
|
||||
/// Performs a multiexponentiation in variable time, automatically selecting the optimal algorithm
|
||||
/// based on the amount of pairs.
|
||||
pub fn multiexp_vartime<G: Group>(pairs: &[(G::Scalar, G)]) -> G
|
||||
where
|
||||
|
||||
@@ -5,7 +5,7 @@ use group::Group;
|
||||
|
||||
use crate::prep_bits;
|
||||
|
||||
// Pippenger's algorithm for multiexponentation, as published in the SIAM Journal on Computing
|
||||
// Pippenger's algorithm for multiexponentiation, as published in the SIAM Journal on Computing
|
||||
// DOI: 10.1137/0209022
|
||||
pub(crate) fn pippenger<G: Group>(pairs: &[(G::Scalar, G)], window: u8) -> G
|
||||
where
|
||||
|
||||
@@ -22,7 +22,7 @@ fn prep_tables<G: Group>(pairs: &[(G::Scalar, G)], window: u8) -> Vec<Vec<G>> {
|
||||
tables
|
||||
}
|
||||
|
||||
// Straus's algorithm for multiexponentation, as published in The American Mathematical Monthly
|
||||
// Straus's algorithm for multiexponentiation, as published in The American Mathematical Monthly
|
||||
// DOI: 10.2307/2310929
|
||||
pub(crate) fn straus<G: Group>(pairs: &[(G::Scalar, G)], window: u8) -> G
|
||||
where
|
||||
|
||||
Reference in New Issue
Block a user