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.

Sign up for GitHub

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 grammatical issues #159

Open
wants to merge 2 commits into
base: main
Choose a base branch
from
Open

Fix grammatical issues #159

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
53d8865
typos mod.rs
Pricstas Dec 20, 2024
000c87d
typos constraints.rs
Pricstas Dec 20, 2024
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 crypto-primitives/src/crh/bowe_hopwood/mod.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
//! The [Bowe-Hopwood-Pedersen] hash is a optimized variant of the Pedersen CRH for
//! The [Bowe-Hopwood-Pedersen] hash is an optimized variant of the Pedersen CRH for
//! specific Twisted Edwards (TE) curves. See [Section 5.4.17 of the Zcash protocol specification](https://raw.githubusercontent.com/zcash/zips/master/protocol/protocol.pdf#concretepedersenhash) for a formal description of this hash function, specialized for the Jubjub curve.
//! The implementation in this repository is generic across choice of TE curves.

Expand Down
2 changes: 1 addition & 1 deletion crypto-primitives/src/merkle_tree/constraints.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -207,7 +207,7 @@ impl<P: Config, F: PrimeField, PG: ConfigGadget<P, F>> PathVar<P, F, PG> {

let mut curr_hash =
PG::TwoToOneHash::evaluate(two_to_one_params, left_hash.borrow(), right_hash.borrow())?;
// To traverse up a MT, we iterate over the path from bottom to top (i.e. in reverse)
// To traverse up an MT, we iterate over the path from bottom to top (i.e. in reverse)

// At any given bit, the bit being 0 indicates our currently hashed value is the left,
// and the bit being 1 indicates our currently hashed value is on the right.
Expand Down