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 typos #835

Merged
merged 6 commits into from
Dec 16, 2024
Merged
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 snarky_integer/integer.ml
Original file line number Diff line number Diff line change
Expand Up @@ -189,7 +189,7 @@ let div_mod (type f) ~m:((module M) as m : f m) a b =
let b_bit_length = Interval.bits_needed b.interval in
let r_bits = Field.choose_preimage_var r ~length:b_bit_length in
Field.Assert.lt ~bit_length:b_bit_length r b.value ;
(* This assertion checkes that the multiplication q * b is safe. *)
(* This assertion checks that the multiplication q * b is safe. *)
assert (q_bit_length + b_bit_length + 1 < Field.Constant.size_in_bits) ;
assert_r1cs q b.value Field.(a.value - r) ;
( { value = q
Expand Down
2 changes: 1 addition & 1 deletion sponge/sponge.ml
Original file line number Diff line number Diff line change
Expand Up @@ -218,7 +218,7 @@ module Make_hash (P : Intf.Permutation) = struct
Array.fold ~init:state blocks ~f:(fun state block ->
add_block ~state block ; perm state )

(* takes an array of field elements, and spread them into blocks/arrays that can contain [rate] fied elements *)
(* takes an array of field elements, and spread them into blocks/arrays that can contain [rate] field elements *)
let to_blocks rate field_elems =
let n = Array.length field_elems in
let num_blocks = if n = 0 then 1 else (n + rate - 1) / rate in
Expand Down
Loading