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

Jump to bottom

Compatibility with respect to Coq PR#262 #366

Merged
merged 1 commit into from
May 14, 2018
Merged

Compatibility with respect to Coq PR#262 #366

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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/Curves/Montgomery/XZ.v
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -124,7 +124,7 @@ Module M.
let (x2, x3) := cswap swap x2 x3 in
let (z2, z3) := cswap swap z2 z3 in
dlet swap := b in
let '((x2, z2), (x3, z3)) := xzladderstep x1 (x2, z2) (x3, z3) in
let '((x2, z2), (x3, z3)) := xzladderstep x1 (x2, z2) (x3, z3) return _ in
let i := BinInt.Z.pred i in (* the third "increment" component of a for loop; either between the test and body or just inlined into the body like here *)
(x2, z2, x3, z3, swap, i)) (* the "return value" of the body is always the exact same variable names as in the beginning of the body because we shadow the original binders, but I think for now this will be unavoidable boilerplate. *)
(BinInt.Z.to_nat scalarbits) (* bound on number of loop iterations, should come between test and body *)
Expand Down