Rename fp-mul-test2 circuit

zkemail · Oct 10, 2024 · 5f549d5 · 5f549d5
1 parent 41d6579
commit 5f549d5
Show file tree

Hide file tree

Showing 2 changed files with 6 additions and 4 deletions.
diff --git a/packages/circuits/tests/fp-mul.test.ts b/packages/circuits/tests/fp-mul.test.ts
@@ -20,7 +20,7 @@ describe('FpMul', () => {
         circuit2 = await wasm_tester(
             path.join(
                 __dirname,
-                './test-circuits/fp-mul-test2.circom'
+                './test-circuits/fp-mul-test-range-check.circom'
             ),
             {
                 recompile: true,

diff --git a/...s/tests/test-circuits/fp-mul-test2.circom → ...t-circuits/fp-mul-test-range-check.circom b/...s/tests/test-circuits/fp-mul-test2.circom → ...t-circuits/fp-mul-test-range-check.circom
@@ -8,13 +8,15 @@ include "../../lib/bigint.circom";
 include "../../lib/bigint-func.circom";
 
 
-/// @title FpMul
-/// @notice Multiple two numbers in Fp
+/// @title FpMul_TestRangeCheck
+/// @notice Multiple two numbers in Fp, where q and r are also provided as inputs only for test purposes
 /// @param a Input 1 to FpMul; assumes to consist of `k` chunks, each of which must fit in `n` bits
 /// @param b Input 2 to FpMul; assumes to consist of `k` chunks, each of which must fit in `n` bits
 /// @param p The modulus; assumes to consist of `k` chunks, each of which must fit in `n` bits
+/// @param q The quotient; assumes to consist of `k` chunks, each of which must fit in `n` bits
+/// @param r The remainder; assumes to consist of `k` chunks, each of which must fit in `n` bits
 /// @output out The result of the FpMul
-template FpMul(n, k) {
+template FpMul_TestRangeCheck(n, k) {
     assert(n + n + log_ceil(k) + 2 <= 252);
 
     signal input a[k];