add fixed-graph-py, generating zero-knowledge proof symbolic graphs

🏴‍☠️ misogynists, bigots, xenophobics, liars: we are coming for you

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**.