Skip to content

Commit

Permalink
Rename r_p_range_check to r_p_lt_check
Browse files Browse the repository at this point in the history
  • Loading branch information
SoraSuegami committed Oct 11, 2024
1 parent d929a31 commit de08dd0
Show file tree
Hide file tree
Showing 2 changed files with 8 additions and 8 deletions.
8 changes: 4 additions & 4 deletions packages/circuits/lib/fp.circom
Original file line number Diff line number Diff line change
Expand Up @@ -41,7 +41,7 @@ template FpMul(n, k) {
component q_range_check[k];
signal r[k];
component r_range_check[k];
component r_p_range_check = BigLessThan(n,k);
component r_p_lt_check = BigLessThan(n,k);
for (var i = 0; i < k; i++) {
q[i] <-- long_div_out[0][i];
q_range_check[i] = Num2Bits(n);
Expand All @@ -51,10 +51,10 @@ template FpMul(n, k) {
r_range_check[i] = Num2Bits(n);
r_range_check[i].in <== r[i];

r_p_range_check.a[i] <== r[i];
r_p_range_check.b[i] <== p[i];
r_p_lt_check.a[i] <== r[i];
r_p_lt_check.b[i] <== p[i];
}
r_p_range_check.out === 1;
r_p_lt_check.out === 1;

signal v_pq_r[2*k-1];
for (var x = 0; x < 2*k-1; x++) {
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -40,18 +40,18 @@ template FpMul_TestRangeCheck(n, k) {
// know it fits into k chunks and can do size n range checks.
component q_range_check[k];
component r_range_check[k];
component r_p_range_check = BigLessThan(n,k);
component r_p_lt_check = BigLessThan(n,k);
for (var i = 0; i < k; i++) {
q_range_check[i] = Num2Bits(n);
q_range_check[i].in <== q[i];

r_range_check[i] = Num2Bits(n);
r_range_check[i].in <== r[i];

r_p_range_check.a[i] <== r[i];
r_p_range_check.b[i] <== p[i];
r_p_lt_check.a[i] <== r[i];
r_p_lt_check.b[i] <== p[i];
}
r_p_range_check.out === 1;
r_p_lt_check.out === 1;

signal v_pq_r[2*k-1];
for (var x = 0; x < 2*k-1; x++) {
Expand Down

0 comments on commit de08dd0

Please sign in to comment.