From fde4aba67e875c8a089b3c23b93cda0f7b393756 Mon Sep 17 00:00:00 2001
From: go outside labs helper <138340846+YnQzZ2w@users.noreply.github.com>
Date: Mon, 13 Nov 2023 17:15:56 -0800
Subject: [PATCH] add fixed-graph-py, generating zero-knowledge proof symbolic
 graphs
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

🏴‍☠️ misogynists, bigots, xenophobics, liars: we are coming for you
---
 README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/README.md b/README.md
index dc36b66..0667c81 100644
--- a/README.md
+++ b/README.md
@@ -20,7 +20,7 @@
 
 <br>
 
-* **[fixed-graph-py, generating zero-knowledge proof symbolic graphs]**
+* **[fixed-graph-py, generating zero-knowledge proof symbolic graphs](https://github.com/go-outside-labs/blockchain-science-py/tree/main/fixed-graph-py)**:
     * in zkps we want to prove a statement where `f` evaluated at `x_i` results in `(y_1,...,y_n)`, i.e., `f(x_1, ..., x_n) = (y_1, ..., y_n)`. this can be expressed as a fixed computational graph, where relationships between nodes are related by operations such as **multiplication or addition**. in addition, some nodes can be related with an **equality relationship** on which the node's value is computed outside of the graph and constrained by a **hint**.