@maci-protocol/circuits 0.0.0-ci.044d30d → 0.0.0-ci.0bef05d

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/voter/poll.circom

@@ -1,92 +0,0 @@
-pragma circom 2.0.0;
-
-// local imports
-include "../utils/hashers.circom";
-include "../utils/privToPubKey.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 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;
-    // 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(3)([derivedPubKey[0], derivedPubKey[1], voiceCreditsBalance]);
-
-    // Inclusion proof  
-    var stateLeafQip = BinaryMerkleRoot(stateTreeDepth)(
-        stateLeaf,
-        actualStateTreeDepth,
-        pathIndices,
-        pathElements
-    );
-
-    stateLeafQip === stateRoot;
-}
-