@maci-protocol/circuits 0.0.0-ci.2653bc0 → 0.0.0-ci.2d2f5fb

package/circom/voter/PollJoined.circom

@@ -0,0 +1,43 @@
+pragma circom 2.0.0;
+
+// local imports
+include "../utils/PoseidonHasher.circom";
+include "../utils/PrivateToPublicKey.circom";
+include "../utils/trees/BinaryMerkleRoot.circom";
+
+// Poll Joined Circuit
+// Allows a user to prove that they have joined a MACI poll.
+// This is to be used with the MACI offchain implementation to allow 
+// users to authenticate to the relayer service (to reduce spamming).
+template PollJoined(stateTreeDepth) {
+    // Constants defining the tree structure
+    var STATE_TREE_ARITY = 2;
+
+    // User's private key
+    signal input privateKey;
+    // User's voice credits balance
+    signal input voiceCreditsBalance;
+    // Path elements
+    signal input pathElements[stateTreeDepth][STATE_TREE_ARITY - 1];
+    // Path indices
+    signal input pathIndices[stateTreeDepth];
+    // Poll State tree root which proves the user is joined
+    signal input stateRoot;
+    // The actual tree depth (might be <= stateTreeDepth) Used in BinaryMerkleRoot
+    signal input actualStateTreeDepth;
+
+     // User private to public key
+    var derivedPublicKey[2] = PrivateToPublicKey()(privateKey);
+
+    var stateLeaf = PoseidonHasher(3)([derivedPublicKey[0], derivedPublicKey[1], voiceCreditsBalance]);
+
+    // Inclusion proof  
+    var calculatedRoot = BinaryMerkleRoot(stateTreeDepth)(
+        stateLeaf,
+        actualStateTreeDepth,
+        pathIndices,
+        pathElements
+    );
+
+    calculatedRoot === stateRoot;
+}

package/circom/voter/PollJoining.circom

@@ -0,0 +1,54 @@
+pragma circom 2.0.0;
+
+// local imports
+include "../utils/PoseidonHasher.circom";
+include "../utils/PrivateToPublicKey.circom";
+include "../utils/trees/BinaryMerkleRoot.circom";
+
+// Poll Joining Circuit
+// Allows a user to prove knowledge of a private key that is signed up to 
+// a MACI contract.
+template PollJoining(stateTreeDepth) {
+    // Constants defining the tree structure
+    var STATE_TREE_ARITY = 2;
+
+    // User's private key
+    signal input privateKey;
+    // Poll's public key
+    signal input pollPublicKey[2];
+    // Siblings
+    signal input siblings[stateTreeDepth][STATE_TREE_ARITY - 1];
+    // Indices
+    signal input indices[stateTreeDepth];
+    // User's hashed private key
+    signal input nullifier;
+    // MACI State tree root which proves the user is signed up
+    signal input stateRoot;
+    // The actual tree depth (might be <= stateTreeDepth) used in BinaryMerkleRoot
+    signal input actualStateTreeDepth;
+    // The poll id
+    signal input pollId;
+
+    // Compute the nullifier (hash of private key and poll id)
+    var computedNullifier = PoseidonHasher(2)([privateKey, pollId]);
+    nullifier === computedNullifier;
+
+    // User private to public key
+    var derivedPublicKey[2] = PrivateToPublicKey()(privateKey);
+    // Hash the public key
+    var publicKeyHash = PoseidonHasher(2)([derivedPublicKey[0], derivedPublicKey[1]]);
+
+    // Ensure the poll public key is the same as the maci one (public input)
+    derivedPublicKey[0] === pollPublicKey[0];
+    derivedPublicKey[1] === pollPublicKey[1];
+
+    // Inclusion proof  
+    var calculatedRoot = BinaryMerkleRoot(stateTreeDepth)(
+        publicKeyHash,
+        actualStateTreeDepth,
+        indices,
+        siblings
+    );
+
+    calculatedRoot === stateRoot;
+}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@maci-protocol/circuits",
-  "version": "0.0.0-ci.2653bc0",
+  "version": "0.0.0-ci.2d2f5fb",
   "private": false,
   "description": "zk-SNARK circuits for MACI",
   "main": "build/ts/index.js",
@@ -18,7 +18,7 @@
   "scripts": {
     "build-test-circuits-c": "ts-node ./ts/compile.ts --cWitness",
     "build-test-circuits-wasm": "ts-node ./ts/compile.ts",
-    "gen-zkeys": "ts-node ./ts/genZkeys.ts",
+    "generate-zkeys": "ts-node ./ts/generateZkeys.ts",
     "info": "NODE_OPTIONS=--max-old-space-size=4096 ts-node ./ts/info.ts",
     "watch": "tsc --watch",
     "build": "tsc -p tsconfig.build.json",
@@ -28,12 +28,15 @@
     "mocha-test": "NODE_OPTIONS=--max-old-space-size=4096 ts-mocha --exit -g '^(?!.*\\[fuzz\\]).*$'",
     "test": "pnpm run mocha-test ts/__tests__/*.test.ts",
     "test:fuzz": "NODE_OPTIONS=--max-old-space-size=4096 ts-mocha --exit -g '\\[fuzz\\]' ./ts/__tests__/*.test.ts",
-    "test:hasher": "pnpm run mocha-test ts/__tests__/Hasher.test.ts",
+    "test:poseidonHasher": "pnpm run mocha-test ts/__tests__/PoseidonHasher.test.ts",
+    "test:messageHasher": "pnpm run mocha-test ts/__tests__/MessageHasher.test.ts",
     "test:slAndBallotTransformer": "pnpm run mocha-test ts/__tests__/StateLeafAndBallotTransformer.test.ts",
+    "test:slAndBallotTransformerFull": "pnpm run mocha-test ts/__tests__/StateLeafAndBallotTransformerFull.test.ts",
     "test:messageToCommand": "pnpm run mocha-test ts/__tests__/MessageToCommand.test.ts",
     "test:messageValidator": "pnpm run mocha-test ts/__tests__/MessageValidator.test.ts",
+    "test:messageValidatorFull": "pnpm run mocha-test ts/__tests__/MessageValidatorFull.test.ts",
     "test:verifySignature": "pnpm run mocha-test ts/__tests__/VerifySignature.test.ts",
-    "test:privToPubKey": "pnpm run mocha-test ts/__tests__/PrivToPubKey.test.ts",
+    "test:privateToPublicKey": "pnpm run mocha-test ts/__tests__/PrivateToPublicKey.test.ts",
     "test:calculateTotal": "pnpm run mocha-test ts/__tests__/CalculateTotal.test.ts",
     "test:processMessages": "pnpm run mocha-test ts/__tests__/ProcessMessages.test.ts",
     "test:tallyVotes": "pnpm run mocha-test ts/__tests__/TallyVotes.test.ts",
@@ -43,10 +46,10 @@
     "test:pollJoined": "pnpm run mocha-test ts/__tests__/PollJoined.test.ts"
   },
   "dependencies": {
-    "@maci-protocol/core": "0.0.0-ci.2653bc0",
-    "@maci-protocol/crypto": "0.0.0-ci.2653bc0",
-    "@maci-protocol/domainobjs": "0.0.0-ci.2653bc0",
-    "@maci-protocol/sdk": "0.0.0-ci.2653bc0",
+    "@maci-protocol/core": "0.0.0-ci.2d2f5fb",
+    "@maci-protocol/crypto": "0.0.0-ci.2d2f5fb",
+    "@maci-protocol/domainobjs": "0.0.0-ci.2d2f5fb",
+    "@maci-protocol/sdk": "0.0.0-ci.2d2f5fb",
     "@zk-kit/circuits": "^0.4.0",
     "circomkit": "^0.3.2",
     "circomlib": "^2.0.5"
@@ -55,17 +58,17 @@
     "@types/chai": "^4.3.11",
     "@types/chai-as-promised": "^7.1.8",
     "@types/mocha": "^10.0.10",
-    "@types/node": "^22.13.10",
+    "@types/node": "^22.15.8",
     "@types/snarkjs": "^0.7.9",
     "@zk-kit/baby-jubjub": "^1.0.3",
     "chai": "^4.3.10",
     "chai-as-promised": "^7.1.2",
-    "fast-check": "^4.0.0",
+    "fast-check": "^4.1.1",
     "glob": "^11.0.1",
     "mocha": "^11.1.0",
     "ts-mocha": "^11.1.0",
     "ts-node": "^10.9.1",
-    "typescript": "^5.8.2"
+    "typescript": "^5.8.3"
   },
-  "gitHead": "244acf2206f9cf6660e2c091f04de18d3c87fd02"
+  "gitHead": "76cfd10ccc6304958b8afc794a66108d44758fa2"
 }

package/build/ts/genZkeys.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"genZkeys.d.ts","sourceRoot":"","sources":["../../ts/genZkeys.ts"],"names":[],"mappings":"AAQA;;;;;;GAMG;AACH,eAAO,MAAM,aAAa,GAAU,aAAa,MAAM,KAAG,OAAO,CAAC,IAAI,CA2CrE,CAAC"}

package/build/ts/genZkeys.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"genZkeys.js","sourceRoot":"","sources":["../../ts/genZkeys.ts"],"names":[],"mappings":";;;;;;AAAA,4CAAkD;AAClD,yCAAgF;AAEhF,4CAAoB;AACpB,gDAAwB;AAIxB;;;;;;GAMG;AACI,MAAM,aAAa,GAAG,KAAK,EAAE,UAAmB,EAAiB,EAAE;IACxE,8BAA8B;IAC9B,MAAM,cAAc,GAAG,cAAI,CAAC,OAAO,CAAC,SAAS,EAAE,IAAI,EAAE,gBAAgB,CAAC,CAAC;IACvE,MAAM,eAAe,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,YAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC,CAAoB,CAAC;IAC3G,MAAM,kBAAkB,GAAG,cAAI,CAAC,OAAO,CAAC,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,eAAe,CAAC,CAAC;IACpF,MAAM,qBAAqB,GAAG,IAAI,CAAC,KAAK,CACtC,MAAM,YAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,kBAAkB,EAAE,OAAO,CAAC,CACZ,CAAC;IAC9C,MAAM,eAAe,GAA4B,MAAM,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC;QAC9G,IAAI;QACJ,GAAG,MAAM;KACV,CAAC,CAAC,CAAC;IAEJ,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,cAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAClE,8BAA8B;IAC9B,IAAI,OAAO,EAAE,CAAC;QACZ,eAAe,CAAC,QAAQ,GAAG,OAAO,CAAC;QACnC,eAAe,CAAC,OAAO,GAAG,OAAO,CAAC;IACpC,CAAC;IAED,MAAM,iBAAiB,GAAG,IAAI,qBAAS,CAAC;QACtC,GAAG,eAAe;QAClB,OAAO,EAAE,KAAK;KACf,CAAC,CAAC;IAEH,oDAAoD;IACpD,4DAA4D;IAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,eAAe,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;QACnD,MAAM,OAAO,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;QAEnC,sCAAsC;QACtC,OAAO,CAAC,GAAG,CAAC,uBAAuB,OAAO,CAAC,IAAI,KAAK,CAAC,CAAC;QAEtD,4CAA4C;QAC5C,MAAM,EAAE,aAAa,EAAE,GAAG,MAAM,iBAAiB,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACtE,kBAAkB;QAClB,MAAM,QAAQ,GAAG,cAAI,CAAC,OAAO,CAAC,eAAe,CAAC,QAAQ,EAAE,OAAO,CAAC,IAAI,EAAE,GAAG,OAAO,CAAC,IAAI,SAAS,CAAC,CAAC;QAChG,4CAA4C;QAC5C,MAAM,YAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,aAAa,EAAE,QAAQ,CAAC,CAAC;IACpD,CAAC;IAED,sCAAsC;IACtC,MAAM,IAAA,kBAAY,GAAE,CAAC;AACvB,CAAC,CAAC;AA3CW,QAAA,aAAa,iBA2CxB;AAEF,IAAI,OAAO,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;IAC5B,CAAC,KAAK,IAAI,EAAE;QACV,MAAM,eAAe,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QAC1D,IAAI,eAAe,KAAK,CAAC,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAA,qBAAa,GAAE,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,MAAM,YAAY,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC;YACzE,MAAM,IAAA,qBAAa,EAAC,YAAY,CAAC,CAAC;QACpC,CAAC;IACH,CAAC,CAAC,EAAE,CAAC;AACP,CAAC"}

package/circom/utils/hashers.circom

@@ -1,78 +0,0 @@
-pragma circom 2.0.0;
-
-// zk-kit imports
-include "./poseidon-cipher.circom";
-
-/**
- * Computes the Poseidon hash for an array of n inputs, including a default initial state 
- * of zero not counted in n. First, extends the inputs by prepending a zero, creating an array [0, inputs]. 
- * Then, the Poseidon hash of the extended inputs is calculated, with the first element of the 
- * result assigned as the output. 
- */
-template PoseidonHasher(n) {
-    signal input inputs[n];
-    signal output out;
-
-    // [0, inputs].
-    var computedExtendedInputs[n + 1];
-    computedExtendedInputs[0] = 0;
-
-    for (var i = 0; i < n; i++) {
-        computedExtendedInputs[i + 1] = inputs[i];
-    }
-
-    // Compute the Poseidon hash of the extended inputs.
-    var computedPoseidonPerm[n + 1]; 
-    computedPoseidonPerm = PoseidonPerm(n + 1)(computedExtendedInputs);
-
-    out <== computedPoseidonPerm[0];
-}
-
-/**
- * Hashes a MACI message and the public key used for message encryption. 
- * This template processes 10 message inputs and a 2-element public key
- * combining them using the Poseidon hash function. The hashing process involves two stages: 
- * 1. hashing message parts in groups of five and,
- * 2. hashing the grouped results alongside the first message input and 
- * the encryption public key to produce a final hash output. 
- */
-template MessageHasher() {
-    // The MACI message is composed of 10 parts.
-    signal input in[10];
-    // the public key used to encrypt the message.
-    signal input encPubKey[2];
-    // we output an hash.
-    signal output hash;
-
-    // Hasher4(
-    //     Hasher5_1(in[1], in[2], in[3], in[4], in[5]),
-    //     Hasher5_2(in[6], in[7], in[8], in[9], in[10])
-    //     in[11],
-    //     in[12]
-    // )
-
-    var computedHasher5_1;
-    computedHasher5_1 = PoseidonHasher(5)([
-        in[0],
-        in[1],
-        in[2],
-        in[3],
-        in[4]
-    ]);
-
-    var computedHasher5_2;
-    computedHasher5_2 = PoseidonHasher(5)([
-        in[5],        
-        in[6],
-        in[7],
-        in[8],
-        in[9]
-    ]);
-
-    hash <== PoseidonHasher(4)([
-        computedHasher5_1,
-        computedHasher5_2,
-        encPubKey[0],
-        encPubKey[1]        
-    ]);
-}

package/circom/utils/messageToCommand.circom

@@ -1,78 +0,0 @@
-pragma circom 2.0.0;
-
-// circomlib import
-include "./bitify.circom";
-// zk-kit imports
-include "./ecdh.circom";
-include "./unpack-element.circom";
-include "./poseidon-cipher.circom";
-// local imports
-include "./hashers.circom";
-
-/**
- * Converts a MACI message to a command by decrypting it.
- * Processes encrypted MACI messages into structured MACI commands 
- * by decrypting using a shared key derived from ECDH. After decryption, 
- * unpacks and assigns decrypted values to specific command components. 
- */
-template MessageToCommand() {
-    var MSG_LENGTH = 7;
-    var PACKED_CMD_LENGTH = 4;
-    var UNPACKED_CMD_LENGTH = 8;
-    var UNPACK_ELEM_LENGTH = 5;
-    var DECRYPTED_LENGTH = 9;
-    var MESSAGE_PARTS = 10;
-
-    // The message is an array of 10 parts.
-    signal input message[MESSAGE_PARTS];
-    signal input encPrivKey;
-    signal input encPubKey[2];
-
-    // Command parts.
-    signal output stateIndex;
-    signal output newPubKey[2];
-    signal output voteOptionIndex;
-    signal output newVoteWeight;
-    signal output nonce;
-    signal output pollId;
-    signal output salt;
-    signal output sigR8[2];
-    signal output sigS;
-    // Packed command. 
-    signal output packedCommandOut[PACKED_CMD_LENGTH];
-
-    // Generate the shared key for decrypting the message.
-    var computedEcdh[2] = Ecdh()(encPrivKey, encPubKey);
-
-    // Decrypt the message using Poseidon decryption.
-    var computedDecryptor[DECRYPTED_LENGTH] = PoseidonDecryptWithoutCheck(MSG_LENGTH)(
-        message,
-        0, 
-        computedEcdh
-    );
-
-    // Save the decrypted message into a packed command signal.
-    signal packedCommand[PACKED_CMD_LENGTH];
-    for (var i = 0; i < PACKED_CMD_LENGTH; i++) {
-        packedCommand[i] <== computedDecryptor[i];
-    }
-
-    var computedUnpackElement[UNPACK_ELEM_LENGTH] = UnpackElement(UNPACK_ELEM_LENGTH)(packedCommand[0]);
-
-    // Everything below were packed into the first element.
-    stateIndex <== computedUnpackElement[4];
-    voteOptionIndex <== computedUnpackElement[3];
-    newVoteWeight <== computedUnpackElement[2];
-    nonce <== computedUnpackElement[1];
-    pollId <== computedUnpackElement[0];
-
-    newPubKey[0] <== packedCommand[1];
-    newPubKey[1] <== packedCommand[2];
-    salt <== packedCommand[3];
-
-    sigR8[0] <== computedDecryptor[4];
-    sigR8[1] <== computedDecryptor[5];
-    sigS <== computedDecryptor[6];
-
-    packedCommandOut <== packedCommand;
-}

package/circom/utils/trees/incrementalMerkleTree.circom

@@ -1,198 +0,0 @@
-pragma circom 2.0.0;
-
-// zk-kit imports
-include "./safe-comparators.circom";
-// circomlib import
-include "./mux1.circom";
-include "./comparators.circom";
-// local import
-include "../hashers.circom";
-include "../calculateTotal.circom";
-
-/**
- * Recomputes a Merkle root from a given leaf and its path in a Merkle tree.
- */
-template MerkleTreeInclusionProof(n_levels) {
-    // The leaf node from which the Merkle root is calculated.
-    signal input leaf;
-    // Indices indicating left or right child for each level of the tree.
-    signal input path_index[n_levels];
-    // Sibling node values required to compute the hash at each level.
-    signal input path_elements[n_levels][1];
-
-    signal output root;
-
-     // Stores the hash at each level starting from the leaf to the root.
-    signal levelHashes[n_levels + 1];
-    // Initialize the first level with the given leaf.
-    levelHashes[0] <== leaf;
-
-    for (var i = 0; i < n_levels; i++) {
-        // Validate path_index to be either 0 or 1, ensuring no other values.
-        path_index[i] * (1 - path_index[i]) === 0;
-
-        // Configure the multiplexer based on the path index for the current level.
-        var c[2][2] = [
-            [levelHashes[i], path_elements[i][0]],
-            [path_elements[i][0], levelHashes[i]]
-        ];
-
-        var mux[2] = MultiMux1(2)(
-            c,
-            path_index[i]
-        );
-
-        var computedLevelHash = PoseidonHasher(2)([mux[0], mux[1]]);
-
-        // Store the resulting hash as the next level's hash.
-        levelHashes[i + 1] <== computedLevelHash;
-    }
-
-    // Set the final level hash as the root.
-    root <== levelHashes[n_levels];
-}
-
-/**
- * Ensures that a leaf exists within a Merkle tree with a given root.
- */
-template LeafExists(levels){
-  // The leaf whose existence within the tree is being verified.
-  signal input leaf;
-
-  // The elements along the path needed for the inclusion proof.
-  signal input path_elements[levels][1];
-  // The indices indicating the path taken through the tree for the leaf.
-  signal input path_index[levels];
-  // The root of the Merkle tree, against which the inclusion is verified.
-  signal input root;
-
-  var computedMerkleRoot = MerkleTreeInclusionProof(levels)(
-    leaf,
-    path_index,
-    path_elements
-  );
-
-  root === computedMerkleRoot;
-}
-
-/**
- * Verifies the correct construction of a Merkle tree from a set of leaves.
- * Given a Merkle root and a list of leaves, check if the root is the
- * correct result of inserting all the leaves into the tree (in the given order).
- */
-template CheckRoot(levels) {
-    // The total number of leaves in the Merkle tree, calculated as 2 to the power of `levels`.
-    var totalLeaves = 2 ** levels;
-    // The number of first-level hashers needed, equal to half the total leaves, as each hasher combines two leaves.
-    var numLeafHashers = totalLeaves / 2;
-    // The number of intermediate hashers, one less than the number of leaf hashers, 
-    // as each level of hashing reduces the number of hash elements by about half.
-    var numIntermediateHashers = numLeafHashers - 1;
-    
-    // Array of leaf values input to the circuit.
-    signal input leaves[totalLeaves];
-
-    // Output signal for the Merkle root that results from hashing all the input leaves.
-    signal output root;
-
-    // Total number of hashers used in constructing the tree, one less than the total number of leaves,
-    // since each level of the tree combines two elements into one.
-    var numHashers = totalLeaves - 1;
-    var computedLevelHashers[numHashers];
-
-    // Initialize hashers for the leaves, each taking two adjacent leaves as inputs.
-    for (var i = 0; i < numLeafHashers; i++){
-        computedLevelHashers[i] = PoseidonHasher(2)([leaves[i*2], leaves[i*2+1]]);
-    }
-
-    // Initialize hashers for intermediate levels, each taking the outputs of two hashers from the previous level.
-    var k = 0;
-    for (var i = numLeafHashers; i < numLeafHashers + numIntermediateHashers; i++) {
-        computedLevelHashers[i] = PoseidonHasher(2)([computedLevelHashers[k*2], computedLevelHashers[k*2+1]]);
-        k++;
-    }
-
-    // Connect the output of the final hasher in the array to the root output signal.
-    root <== computedLevelHashers[numHashers-1];
-}
-
-/**
- * Calculates the path indices required for Merkle proof verifications. 
- * Given a node index within an IMT and the total tree levels, it outputs the path indices leading to that node.
- * The template handles the modulo and division operations to break down the tree index into its constituent path indices.
- */
-template MerkleGeneratePathIndices(levels) {
-    var BASE = 2;
-
-    signal input in; 
-    signal output out[levels];
-
-    var m = in;
-    var computedResults[levels];
-
-    for (var i = 0; i < levels; i++) {
-        // circom's best practices suggests to avoid using <-- unless you
-        // are aware of what's going on. This is the only way to do modulo operation.
-        out[i] <-- m % BASE;
-        m = m \ BASE;
-
-        // Check that each output element is less than the base.
-        var computedIsOutputElementLessThanBase = SafeLessThan(3)([out[i], BASE]);
-        computedIsOutputElementLessThanBase === 1;
-
-        // Re-compute the total sum.
-        computedResults[i] = out[i] * (BASE ** i);
-    }
-    
-    // Check that the total sum matches the index.
-    var computedCalculateTotal = CalculateTotal(levels)(computedResults);
-
-    computedCalculateTotal === in;
-}
-
-// @note taken from @zk-kit/circuits
-// if used directly in processMessages circom complains about duplicated
-// templates (Ark, Poseidon, etc.)
-// This circuit is designed to calculate the root of a binary Merkle
-// tree given a leaf, its depth, and the necessary sibling
-// information (aka proof of membership).
-// A circuit is designed without the capability to iterate through
-// a dynamic array. To address this, a parameter with the static maximum
-// tree depth is defined (i.e. 'MAX_DEPTH'). And additionally, the circuit
-// receives a dynamic depth as an input, which is utilized in calculating the
-// true root of the Merkle tree. The actual depth of the Merkle tree
-// may be equal to or less than the static maximum depth.
-// NOTE: This circuit will successfully verify `out = 0` for `depth > MAX_DEPTH`.
-// Make sure to enforce `depth <= MAX_DEPTH` outside the circuit.
-template BinaryMerkleRoot(MAX_DEPTH) {
-    signal input leaf, depth, indices[MAX_DEPTH], siblings[MAX_DEPTH][1];
-
-    signal output out;
-
-    signal nodes[MAX_DEPTH + 1];
-    nodes[0] <== leaf;
-
-    signal roots[MAX_DEPTH];
-    var root = 0;
-
-    for (var i = 0; i < MAX_DEPTH; i++) {
-        var isDepth = IsEqual()([depth, i]);
-
-        roots[i] <== isDepth * nodes[i];
-
-        root += roots[i];
-
-        var c[2][2] = [
-            [nodes[i], siblings[i][0]],
-            [siblings[i][0], nodes[i]]
-        ];
-        
-        var childNodes[2] = MultiMux1(2)(c, indices[i]);
-
-        nodes[i + 1] <== PoseidonHasher(2)(childNodes);
-    }
-
-    var isDepth = IsEqual()([depth, MAX_DEPTH]);
-
-    out <== root + isDepth * nodes[MAX_DEPTH];
-}

package/circom/voter/poll.circom

@@ -1,93 +0,0 @@
-pragma circom 2.0.0;
-
-// local imports
-include "../utils/hashers.circom";
-include "../utils/privToPubKey.circom";
-include "../utils/trees/incrementalMerkleTree.circom";
-
-// Poll Joining Circuit
-// Allows a user to prove knowledge of a private key that is signed up to 
-// a MACI contract.
-template PollJoining(stateTreeDepth) {
-    // Constants defining the tree structure
-    var STATE_TREE_ARITY = 2;
-
-    // User's private key
-    signal input privKey;
-    // Poll's public key
-    signal input pollPubKey[2];
-    // Siblings
-    signal input siblings[stateTreeDepth][STATE_TREE_ARITY - 1];
-    // Indices
-    signal input indices[stateTreeDepth];
-    // User's hashed private key
-    signal input nullifier;
-    // MACI State tree root which proves the user is signed up
-    signal input stateRoot;
-    // The actual tree depth (might be <= stateTreeDepth) used in BinaryMerkleRoot
-    signal input actualStateTreeDepth;
-    // The poll id
-    signal input pollId;
-
-    // Compute the nullifier (hash of private key and poll id)
-    var computedNullifier = PoseidonHasher(2)([privKey, pollId]);
-    nullifier === computedNullifier;
-
-    // User private to public key
-    var derivedPubKey[2] = PrivToPubKey()(privKey);
-    // Hash the public key
-    var pubKeyHash = PoseidonHasher(2)([derivedPubKey[0], derivedPubKey[1]]);
-
-    // Ensure the poll public key is the same as the maci one (public input)
-    derivedPubKey[0] === pollPubKey[0];
-    derivedPubKey[1] === pollPubKey[1];
-
-    // Inclusion proof  
-    var calculatedRoot = BinaryMerkleRoot(stateTreeDepth)(
-        pubKeyHash,
-        actualStateTreeDepth,
-        indices,
-        siblings
-    );
-
-    calculatedRoot === stateRoot;
-}
-
-// Poll Joined Circuit
-// Allows a user to prove that they have joined a MACI poll.
-// This is to be used with the MACI offchain implementation to allow 
-// users to authenticate to the relayer service (to reduce spamming).
-template PollJoined(stateTreeDepth) {
-    // Constants defining the tree structure
-    var STATE_TREE_ARITY = 2;
-
-    // User's private key
-    signal input privKey;
-    // User's voice credits balance
-    signal input voiceCreditsBalance;
-    // Poll's joined timestamp
-    signal input joinTimestamp;
-    // Path elements
-    signal input pathElements[stateTreeDepth][STATE_TREE_ARITY - 1];
-    // Path indices
-    signal input pathIndices[stateTreeDepth];
-    // Poll State tree root which proves the user is joined
-    signal input stateRoot;
-    // The actual tree depth (might be <= stateTreeDepth) Used in BinaryMerkleRoot
-    signal input actualStateTreeDepth;
-
-     // User private to public key
-    var derivedPubKey[2] = PrivToPubKey()(privKey);
-
-    var stateLeaf = PoseidonHasher(4)([derivedPubKey[0], derivedPubKey[1], voiceCreditsBalance, joinTimestamp]);
-
-    // Inclusion proof  
-    var stateLeafQip = BinaryMerkleRoot(stateTreeDepth)(
-        stateLeaf,
-        actualStateTreeDepth,
-        pathIndices,
-        pathElements
-    );
-
-    stateLeafQip === stateRoot;
-}