@maci-protocol/website 0.0.0-ci.7fb1869 → 0.0.0-ci.7fb2610

package/docusaurus.config.ts

@@ -204,9 +204,15 @@ async function getConfig(): Promise<Config> {
         phpLoader: "matomo.php",
         jsLoader: "matomo.js",
       },
+      mermaid: {
+        theme: { light: "neutral", dark: "forest" },
+      },
     } satisfies Preset.ThemeConfig,
+    markdown: {
+      mermaid: true,
+    },
+    themes: ["@docusaurus/theme-mermaid"],
   };
-
   return config;
 }
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@maci-protocol/website",
-  "version": "0.0.0-ci.7fb1869",
+  "version": "0.0.0-ci.7fb2610",
   "private": false,
   "publishConfig": {
     "access": "public"
@@ -25,7 +25,8 @@
     "@docusaurus/preset-classic": "^3.8.1",
     "@docusaurus/theme-classic": "^3.8.1",
     "@docusaurus/theme-common": "^3.8.1",
-    "@easyops-cn/docusaurus-search-local": "^0.51.0",
+    "@docusaurus/theme-mermaid": "^3.8.1",
+    "@easyops-cn/docusaurus-search-local": "^0.51.1",
     "@mdx-js/react": "^3.1.0",
     "clsx": "^2.1.1",
     "docusaurus-plugin-image-zoom": "^3.0.1",
@@ -41,7 +42,7 @@
     "@docusaurus/module-type-aliases": "^3.8.1",
     "@docusaurus/tsconfig": "^3.8.1",
     "@docusaurus/types": "^3.8.1",
-    "@types/node": "^24.0.1",
+    "@types/node": "^24.0.13",
     "@types/react": "^19.1.8",
     "ts-node": "^10.9.2",
     "typescript": "^5.8.3"
@@ -61,5 +62,5 @@
   "engines": {
     "node": ">=18.0"
   },
-  "gitHead": "0f72404b1f1e5b714ada9e5598dc2d0da5feade5"
+  "gitHead": "fcd1afd0564543b3f35fea14eac1e2e9383384b5"
 }

package/versioned_docs/version-v0.x/introduction.md

@@ -41,9 +41,7 @@ Refer to the [Glossary](#glossary) for definitions of terms.
 3. The signup period ends after a fixed amount of time. From that point onwards, users may no longer invoke `signUp()` in this contract.
 
 4. Each user votes. To do this, they:
-
    - Sign their command using the key which they had signed up with and then use a random (ephemeral) key as well as the coordinator's public key to generate a shared key (via ECDH) encrypt it.
-
      - If they are bribed, the user should sign it using an old public key which has already been replaced with a new one.
 
      - Otherwise, the user should use the most current public key they have registered.
@@ -53,9 +51,7 @@ Refer to the [Glossary](#glossary) for definitions of terms.
 5. The coordinator processes all the commands after the voting period ends.
 
 6. For each batch of commands, they perform the following steps:
-
    - Generate a new state root which is the result of:
-
      - For each valid command, in reverse order, update the state leaf accordingly
 
      - Ignore all invalid commands

package/versioned_docs/version-v3.x/technical-references/zk-snark-circuits/processMessages.md

@@ -18,7 +18,67 @@ The pre-requisites for this circuit are:
 
 This circuit requires the coordinator's private key, hence a proof for this circuit can only be generated by the coordinator. The private key is needed in order to generate the ECDH shared key used to decrypt the messages.
 
-![ProcessMessages](/img/circuits/processMessages_2_0.svg)
+```mermaid
+flowchart LR
+        parameters(["MessageProcessorQv - Parameters"])
+        parameters --> stateTreeDepth["stateTreeDepth"]
+        parameters --> batchSize["batchSize"]
+        parameters --> voteOptionTreeDepth["voteOptionTreeDepth"]
+
+        stateTreeDepth & batchSize & voteOptionTreeDepth --> publicInputs["Public inputs"]
+
+        subgraph publicInputs
+            direction LR
+            totalSignups ~~~ index
+            batchEndIndex ~~~ currentSbCommitment
+            newSbCommitment ~~~ outputBatchHash
+            actualStateTreeDepth ~~~ coordinatorPublicKeyHash
+            voteOptions
+        end
+
+        publicInputs --> privateInputs
+
+        subgraph privateInputs
+            direction LR
+            inputBatchHash ~~~ messages
+            coordinatorPrivateKey ~~~ encryptionPublicKeys
+            currentStateRoot ~~~ currentStateLeaves
+            currentStateLeavesPathElements ~~~ currentSbSalt
+            newSbSalt ~~~ currentBallotRoot
+            currentBallots ~~~ currentBallotsPathElements
+            currentVoteWeights ~~~ currentVoteWeightsPathElements
+        end
+
+        privateInputs --> step1["1 - Verify currentSbCommitment"]
+        step1 --> step1B["hash(currentStateRoot, currentBallotRoot, currentSbSalt)"]
+
+        privateInputs --> step2["2 – Check voteOptions upper-bound"]
+        step2 --> step2B["voteOptions <= 5 ** voteOptionTreeDepth"]
+
+        privateInputs --> step3["3 – Ensure totalSignups within capacity"]
+        step3 --> step3B["totalSignups <= 2 ** stateTreeDepth"]
+
+        privateInputs --> step4["4 – Hash each message + pub-key"]
+        step4 --> step4B["MessageHasher template loop"]
+
+        privateInputs --> step5["5 – Build and verify chainHash"]
+        step5 --> step5B["PoseidonHasher template loop + Mux1"]
+
+        privateInputs --> step6["6 – Derive & verify coordinator pubKey"]
+        step6 --> step6B["PrivateToPublicKey -> derivedPublicKeyHash == coordinatorPublicKeyHash"]
+
+        privateInputs --> step7["7 – Decrypt each message to a command using MessageToCommand"]
+        step7 --> step7B["MessageToCommand template loop"]
+
+        privateInputs --> step8["8 – Process messages in reverse order"]
+        step8 --> step8B["SingleMessageProcessorQv template loop"]
+
+        privateInputs --> step9["9 – Compute newSbCommitment"]
+        step9 --> step9B["hash(stateRoot, ballotRoot, newSbSalt)"]
+
+        privateInputs --> step10["10 – Verify provided newSbCommitment"]
+        step10 --> step10B["equality with computed commitment"]
+```
 
 :::info
 A version working with non quadratic voting (non-qv) is also [available](https://github.com/privacy-scaling-explorations/maci/blob/dev/circuits/circom/coordinator/non-qv/MessageProcessor.circom). This version is called `MessageProcessorNonQV` and is to be used when the Poll is not using the quadratic voting feature. Note that by default MACI works with quadratic voting.