From b90767e40dbe0cebcdf0269b2bb0fcb51d1a38bb Mon Sep 17 00:00:00 2001 From: cedoor Date: Wed, 29 Nov 2023 15:49:18 +0000 Subject: [PATCH] chore(circuits): update binary merkle root parameter --- packages/circuits/circom/circuits.json | 2 +- packages/circuits/tests/binary-merkle-root.test.ts | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/packages/circuits/circom/circuits.json b/packages/circuits/circom/circuits.json index 5f6fa74fb..6a94add26 100644 --- a/packages/circuits/circom/circuits.json +++ b/packages/circuits/circom/circuits.json @@ -6,6 +6,6 @@ "binary-merkle-root": { "file": "binary-merkle-root", "template": "BinaryMerkleRoot", - "params": [20] + "params": [4] } } diff --git a/packages/circuits/tests/binary-merkle-root.test.ts b/packages/circuits/tests/binary-merkle-root.test.ts index 8515c2f33..700717f1a 100644 --- a/packages/circuits/tests/binary-merkle-root.test.ts +++ b/packages/circuits/tests/binary-merkle-root.test.ts @@ -23,7 +23,7 @@ describe("binary-merkle-root", () => { // The circuit tree depth is 20, so the number of siblings must be 20, even if // the tree depth is actually 3. The missing siblings can be set to 0, as they // won't be used to calculate the root in the circuit. - const indices = [] + const indices: number[] = [] for (let i = 0; i < MAX_DEPTH; i += 1) { indices.push((index >> i) & 1)