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

Fix some typos #1606

Closed
wants to merge 3 commits into from
Closed
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
4 changes: 2 additions & 2 deletions plonky2/src/fri/prover.rs
Original file line number Diff line number Diff line change
Expand Up @@ -62,7 +62,7 @@ pub fn fri_proof<F: RichField + Extendable<D>, C: GenericConfig<D, F = F>, const
}
}

type FriCommitedTrees<F, C, const D: usize> = (
type FriCommittedTrees<F, C, const D: usize> = (
Vec<MerkleTree<F, <C as GenericConfig<D>>::Hasher>>,
PolynomialCoeffs<<F as Extendable<D>>::Extension>,
);
Expand All @@ -72,7 +72,7 @@ fn fri_committed_trees<F: RichField + Extendable<D>, C: GenericConfig<D, F = F>,
mut values: PolynomialValues<F::Extension>,
challenger: &mut Challenger<F, C::Hasher>,
fri_params: &FriParams,
) -> FriCommitedTrees<F, C, D> {
) -> FriCommittedTrees<F, C, D> {
let mut trees = Vec::with_capacity(fri_params.reduction_arity_bits.len());

let mut shift = F::MULTIPLICATIVE_GROUP_GENERATOR;
Expand Down
4 changes: 2 additions & 2 deletions projects/cache-friendly-fft/__init__.py
Original file line number Diff line number Diff line change
Expand Up @@ -174,7 +174,7 @@ def _fft_inplace(x, scratch):
_fft_inplace_evenpow(x, scratch)


def _scrach_length(lb_n):
def _scratch_length(lb_n):
"""Find the amount of scratch space required to run the FFT.

Layers where the input's length is an even power of two do not
Expand Down Expand Up @@ -206,7 +206,7 @@ def fft(x):
# We have one scratch buffer for the whole algorithm. If we were to
# parallelize it, we'd need one thread-local buffer for each worker
# thread.
scratch_len = _scrach_length(lb_n)
scratch_len = _scratch_length(lb_n)
if scratch_len == 0:
scratch = None
else:
Expand Down