This repository has been archived by the owner on Dec 11, 2024. It is now read-only.
add fixed-graph-py, generating zero-knowledge proof symbolic graphs #39
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Description:
in zkps we want to prove a statement where
fevaluated atx_iresults 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.
🏴☠️ misogynists, bigots, xenophobic, liars: we are coming for you.