@maci-protocol/circuits 0.0.0-ci.26f28d6

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (39) hide show
  1. package/CHANGELOG.md +673 -0
  2. package/LICENSE +22 -0
  3. package/README.md +20 -0
  4. package/build/ts/compile.d.ts +10 -0
  5. package/build/ts/compile.d.ts.map +1 -0
  6. package/build/ts/compile.js +123 -0
  7. package/build/ts/compile.js.map +1 -0
  8. package/build/ts/genZkeys.d.ts +9 -0
  9. package/build/ts/genZkeys.d.ts.map +1 -0
  10. package/build/ts/genZkeys.js +67 -0
  11. package/build/ts/genZkeys.js.map +1 -0
  12. package/build/ts/info.d.ts +2 -0
  13. package/build/ts/info.d.ts.map +1 -0
  14. package/build/ts/info.js +72 -0
  15. package/build/ts/info.js.map +1 -0
  16. package/build/ts/types.d.ts +105 -0
  17. package/build/ts/types.d.ts.map +1 -0
  18. package/build/ts/types.js +3 -0
  19. package/build/ts/types.js.map +1 -0
  20. package/build/tsconfig.build.tsbuildinfo +1 -0
  21. package/circom/circuits.json +58 -0
  22. package/circom/coordinator/non-qv/processMessages.circom +447 -0
  23. package/circom/coordinator/non-qv/tallyVotes.circom +232 -0
  24. package/circom/coordinator/qv/processMessages.circom +449 -0
  25. package/circom/coordinator/qv/tallyVotes.circom +277 -0
  26. package/circom/utils/calculateTotal.circom +22 -0
  27. package/circom/utils/hashers.circom +78 -0
  28. package/circom/utils/messageToCommand.circom +78 -0
  29. package/circom/utils/non-qv/messageValidator.circom +89 -0
  30. package/circom/utils/non-qv/stateLeafAndBallotTransformer.circom +105 -0
  31. package/circom/utils/privToPubKey.circom +36 -0
  32. package/circom/utils/qv/messageValidator.circom +95 -0
  33. package/circom/utils/qv/stateLeafAndBallotTransformer.circom +105 -0
  34. package/circom/utils/trees/incrementalMerkleTree.circom +198 -0
  35. package/circom/utils/trees/incrementalQuinaryTree.circom +287 -0
  36. package/circom/utils/verifySignature.circom +117 -0
  37. package/circom/voter/poll.circom +93 -0
  38. package/circomkit.json +18 -0
  39. package/package.json +71 -0
@@ -0,0 +1,117 @@
1
+ pragma circom 2.0.0;
2
+
3
+ // circomlib imports
4
+ include "./compconstant.circom";
5
+ include "./comparators.circom";
6
+ include "./pointbits.circom";
7
+ include "./bitify.circom";
8
+ include "./escalarmulany.circom";
9
+ include "./escalarmulfix.circom";
10
+ // local imports
11
+ include "./hashers.circom";
12
+
13
+ /**
14
+ * Variant of the EdDSAPoseidonVerifier template from circomlib
15
+ * https://github.com/iden3/circomlib/blob/master/circuits/eddsa.circom
16
+ */
17
+ template EdDSAPoseidonVerifier_patched() {
18
+ // The x and y coordinates of the public key.
19
+ signal input Ax;
20
+ signal input Ay;
21
+ // Signature scalar.
22
+ signal input S;
23
+ // The x and y coordinates of the signature point.
24
+ signal input R8x;
25
+ signal input R8y;
26
+ // Message hash.
27
+ signal input M;
28
+
29
+ signal output valid;
30
+
31
+ // Ensure S<Subgroup Order.
32
+ // convert the signature scalar S into its binary representation.
33
+ var computedNum2Bits[254] = Num2Bits(254)(S);
34
+
35
+ var computedCompConstantIn[254] = computedNum2Bits;
36
+ computedCompConstantIn[253] = 0;
37
+
38
+ // A component that ensures S is within a valid range,
39
+ // comparing it against a constant representing the subgroup order.
40
+ var computedCompConstant = CompConstant(2736030358979909402780800718157159386076813972158567259200215660948447373040)(computedCompConstantIn);
41
+
42
+ // Calculate the h = H(R,A, msg).
43
+ var computedH2Bits[254] = Num2Bits_strict()(PoseidonHasher(5)([R8x, R8y, Ax, Ay, M]));
44
+
45
+ // These components perform point doubling operations on the public key
46
+ // to align it within the correct subgroup as part of the verification process.
47
+ var (computedDbl1XOut, computedDbl1YOut) = BabyDbl()(Ax, Ay);
48
+ var (computedDbl2XOut, computedDbl2YOut) = BabyDbl()(computedDbl1XOut, computedDbl1YOut);
49
+ var (computedDbl3XOut, computedDbl3YOut) = BabyDbl()(computedDbl2XOut, computedDbl2YOut);
50
+
51
+ // A component that performs scalar multiplication of the
52
+ // adjusted public key by the hash output, essential for the verification calculation.
53
+ var computedEscalarMulAny[2] = EscalarMulAny(254)(computedH2Bits, [computedDbl3XOut, computedDbl3YOut]);
54
+
55
+ // Compute the right side: right = R8 + right2.
56
+ var (computedAddRightXOut, computedAddRightYOut) = BabyAdd()(R8x, R8y, computedEscalarMulAny[0], computedEscalarMulAny[1]);
57
+
58
+ // Calculate the left side: left = S * B8.
59
+ var BASE8[2] = [
60
+ 5299619240641551281634865583518297030282874472190772894086521144482721001553,
61
+ 16950150798460657717958625567821834550301663161624707787222815936182638968203
62
+ ];
63
+
64
+ // Fixed-base scalar multiplication of a base point by S.
65
+ var computedEscalarMulFix[2] = EscalarMulFix(254, BASE8)(computedNum2Bits);
66
+
67
+ // Components to check the equality of x and y coordinates
68
+ // between the computed and expected points of the signature.
69
+ var computedIsRightValid = IsEqual()([computedEscalarMulFix[0], computedAddRightXOut]);
70
+ var computedIsLeftValid = IsEqual()([computedEscalarMulFix[1], computedAddRightYOut]);
71
+ var computedIsLeftRightValid = IsEqual()([computedIsRightValid + computedIsLeftValid, 2]);
72
+
73
+ // Components to handle edge cases and ensure that all conditions
74
+ // for a valid signature are met, including the
75
+ // public key not being zero and other integrity checks.
76
+ var computedIsAxZero = IsZero()(Ax);
77
+ var computedIsAxEqual = IsEqual()([computedIsAxZero, 0]);
78
+ var computedIsCcZero = IsZero()(computedCompConstant);
79
+ var computedIsValid = IsEqual()([computedIsLeftRightValid + computedIsAxEqual + computedIsCcZero, 3]);
80
+
81
+ valid <== computedIsValid;
82
+ }
83
+
84
+ /**
85
+ * Verifies the EdDSA signature for a given command, which has exactly four elements in the hash preimage.
86
+ */
87
+ template VerifySignature() {
88
+ // Public key of the signer, consisting of two coordinates [x, y].
89
+ signal input pubKey[2];
90
+ // R8 point from the signature, consisting of two coordinates [x, y].
91
+ signal input R8[2];
92
+ // Scalar component of the signature.
93
+ signal input S;
94
+
95
+ // Number of elements in the hash preimage.
96
+ var k = 4;
97
+
98
+ // The preimage data that was hashed, an array of four elements.
99
+ signal input preimage[k];
100
+
101
+ signal output valid;
102
+
103
+ // Hash the preimage using the Poseidon hashing function configured for four inputs.
104
+ var computedM = PoseidonHasher(4)(preimage);
105
+
106
+ // Instantiate the patched EdDSA Poseidon verifier with the necessary inputs.
107
+ var computedVerifier = EdDSAPoseidonVerifier_patched()(
108
+ pubKey[0],
109
+ pubKey[1],
110
+ S,
111
+ R8[0],
112
+ R8[1],
113
+ computedM
114
+ );
115
+
116
+ valid <== computedVerifier;
117
+ }
@@ -0,0 +1,93 @@
1
+ pragma circom 2.0.0;
2
+
3
+ // local imports
4
+ include "../utils/hashers.circom";
5
+ include "../utils/privToPubKey.circom";
6
+ include "../utils/trees/incrementalMerkleTree.circom";
7
+
8
+ // Poll Joining Circuit
9
+ // Allows a user to prove knowledge of a private key that is signed up to
10
+ // a MACI contract.
11
+ template PollJoining(stateTreeDepth) {
12
+ // Constants defining the tree structure
13
+ var STATE_TREE_ARITY = 2;
14
+
15
+ // User's private key
16
+ signal input privKey;
17
+ // Poll's public key
18
+ signal input pollPubKey[2];
19
+ // Siblings
20
+ signal input siblings[stateTreeDepth][STATE_TREE_ARITY - 1];
21
+ // Indices
22
+ signal input indices[stateTreeDepth];
23
+ // User's hashed private key
24
+ signal input nullifier;
25
+ // MACI State tree root which proves the user is signed up
26
+ signal input stateRoot;
27
+ // The actual tree depth (might be <= stateTreeDepth) used in BinaryMerkleRoot
28
+ signal input actualStateTreeDepth;
29
+ // The poll id
30
+ signal input pollId;
31
+
32
+ // Compute the nullifier (hash of private key and poll id)
33
+ var computedNullifier = PoseidonHasher(2)([privKey, pollId]);
34
+ nullifier === computedNullifier;
35
+
36
+ // User private to public key
37
+ var derivedPubKey[2] = PrivToPubKey()(privKey);
38
+ // Hash the public key
39
+ var pubKeyHash = PoseidonHasher(2)([derivedPubKey[0], derivedPubKey[1]]);
40
+
41
+ // Ensure the poll public key is the same as the maci one (public input)
42
+ derivedPubKey[0] === pollPubKey[0];
43
+ derivedPubKey[1] === pollPubKey[1];
44
+
45
+ // Inclusion proof
46
+ var calculatedRoot = BinaryMerkleRoot(stateTreeDepth)(
47
+ pubKeyHash,
48
+ actualStateTreeDepth,
49
+ indices,
50
+ siblings
51
+ );
52
+
53
+ calculatedRoot === stateRoot;
54
+ }
55
+
56
+ // Poll Joined Circuit
57
+ // Allows a user to prove that they have joined a MACI poll.
58
+ // This is to be used with the MACI offchain implementation to allow
59
+ // users to authenticate to the relayer service (to reduce spamming).
60
+ template PollJoined(stateTreeDepth) {
61
+ // Constants defining the tree structure
62
+ var STATE_TREE_ARITY = 2;
63
+
64
+ // User's private key
65
+ signal input privKey;
66
+ // User's voice credits balance
67
+ signal input voiceCreditsBalance;
68
+ // Poll's joined timestamp
69
+ signal input joinTimestamp;
70
+ // Path elements
71
+ signal input pathElements[stateTreeDepth][STATE_TREE_ARITY - 1];
72
+ // Path indices
73
+ signal input pathIndices[stateTreeDepth];
74
+ // Poll State tree root which proves the user is joined
75
+ signal input stateRoot;
76
+ // The actual tree depth (might be <= stateTreeDepth) Used in BinaryMerkleRoot
77
+ signal input actualStateTreeDepth;
78
+
79
+ // User private to public key
80
+ var derivedPubKey[2] = PrivToPubKey()(privKey);
81
+
82
+ var stateLeaf = PoseidonHasher(4)([derivedPubKey[0], derivedPubKey[1], voiceCreditsBalance, joinTimestamp]);
83
+
84
+ // Inclusion proof
85
+ var stateLeafQip = BinaryMerkleRoot(stateTreeDepth)(
86
+ stateLeaf,
87
+ actualStateTreeDepth,
88
+ pathIndices,
89
+ pathElements
90
+ );
91
+
92
+ stateLeafQip === stateRoot;
93
+ }
package/circomkit.json ADDED
@@ -0,0 +1,18 @@
1
+ {
2
+ "protocol": "groth16",
3
+ "prime": "bn128",
4
+ "version": "2.1.6",
5
+ "circuits": "./circom/circuits.json",
6
+ "dirPtau": "./ptau",
7
+ "dirCircuits": "./circom",
8
+ "dirInputs": "./inputs",
9
+ "dirBuild": "./build",
10
+ "optimization": 2,
11
+ "inspect": false,
12
+ "include": ["./node_modules/circomlib/circuits", "./node_modules/@zk-kit/circuits/circom"],
13
+ "groth16numContributions": 0,
14
+ "groth16askForEntropy": false,
15
+ "logLevel": "INFO",
16
+ "verbose": true,
17
+ "cWitness": true
18
+ }
package/package.json ADDED
@@ -0,0 +1,71 @@
1
+ {
2
+ "name": "@maci-protocol/circuits",
3
+ "version": "0.0.0-ci.26f28d6",
4
+ "private": false,
5
+ "description": "zk-SNARK circuits for MACI",
6
+ "main": "build/ts/index.js",
7
+ "files": [
8
+ "build",
9
+ "circom",
10
+ "circomkit.json",
11
+ "LICENSE",
12
+ "README.md",
13
+ "CHANGELOG.md"
14
+ ],
15
+ "publishConfig": {
16
+ "access": "public"
17
+ },
18
+ "scripts": {
19
+ "build-test-circuits-c": "ts-node ./ts/compile.ts --cWitness",
20
+ "build-test-circuits-wasm": "ts-node ./ts/compile.ts",
21
+ "gen-zkeys": "ts-node ./ts/genZkeys.ts",
22
+ "info": "NODE_OPTIONS=--max-old-space-size=4096 ts-node ./ts/info.ts",
23
+ "watch": "tsc --watch",
24
+ "build": "tsc -p tsconfig.build.json",
25
+ "circom:build": "NODE_OPTIONS=--max-old-space-size=4096 circomkit compile",
26
+ "circom:setup": "NODE_OPTIONS=--max-old-space-size=4096 circomkit setup",
27
+ "types": "tsc -p tsconfig.json --noEmit",
28
+ "mocha-test": "NODE_OPTIONS=--max-old-space-size=4096 ts-mocha --exit -g '^(?!.*\\[fuzz\\]).*$'",
29
+ "test": "pnpm run mocha-test ts/__tests__/*.test.ts",
30
+ "test:fuzz": "NODE_OPTIONS=--max-old-space-size=4096 ts-mocha --exit -g '\\[fuzz\\]' ./ts/__tests__/*.test.ts",
31
+ "test:hasher": "pnpm run mocha-test ts/__tests__/Hasher.test.ts",
32
+ "test:slAndBallotTransformer": "pnpm run mocha-test ts/__tests__/StateLeafAndBallotTransformer.test.ts",
33
+ "test:messageToCommand": "pnpm run mocha-test ts/__tests__/MessageToCommand.test.ts",
34
+ "test:messageValidator": "pnpm run mocha-test ts/__tests__/MessageValidator.test.ts",
35
+ "test:verifySignature": "pnpm run mocha-test ts/__tests__/VerifySignature.test.ts",
36
+ "test:privToPubKey": "pnpm run mocha-test ts/__tests__/PrivToPubKey.test.ts",
37
+ "test:calculateTotal": "pnpm run mocha-test ts/__tests__/CalculateTotal.test.ts",
38
+ "test:processMessages": "pnpm run mocha-test ts/__tests__/ProcessMessages.test.ts",
39
+ "test:tallyVotes": "pnpm run mocha-test ts/__tests__/TallyVotes.test.ts",
40
+ "test:ceremonyParams": "pnpm run mocha-test ts/__tests__/CeremonyParams.test.ts",
41
+ "test:incrementalQuinaryTree": "pnpm run mocha-test ts/__tests__/IncrementalQuinaryTree.test.ts",
42
+ "test:pollJoining": "pnpm run mocha-test ts/__tests__/PollJoining.test.ts",
43
+ "test:pollJoined": "pnpm run mocha-test ts/__tests__/PollJoined.test.ts"
44
+ },
45
+ "dependencies": {
46
+ "@maci-protocol/core": "0.0.0-ci.26f28d6",
47
+ "@maci-protocol/crypto": "0.0.0-ci.26f28d6",
48
+ "@maci-protocol/domainobjs": "0.0.0-ci.26f28d6",
49
+ "@maci-protocol/sdk": "0.0.0-ci.26f28d6",
50
+ "@zk-kit/circuits": "^0.4.0",
51
+ "circomkit": "^0.3.2",
52
+ "circomlib": "^2.0.5"
53
+ },
54
+ "devDependencies": {
55
+ "@types/chai": "^4.3.11",
56
+ "@types/chai-as-promised": "^7.1.8",
57
+ "@types/mocha": "^10.0.10",
58
+ "@types/node": "^22.13.10",
59
+ "@types/snarkjs": "^0.7.9",
60
+ "@zk-kit/baby-jubjub": "^1.0.3",
61
+ "chai": "^4.3.10",
62
+ "chai-as-promised": "^7.1.2",
63
+ "fast-check": "^4.0.0",
64
+ "glob": "^11.0.1",
65
+ "mocha": "^11.1.0",
66
+ "ts-mocha": "^11.1.0",
67
+ "ts-node": "^10.9.1",
68
+ "typescript": "^5.8.2"
69
+ },
70
+ "gitHead": "5005cb2c5694441aab1ba5ccaffc936cb282a9b4"
71
+ }