-
Notifications
You must be signed in to change notification settings - Fork 55
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Hyperplonk protocol description #3
Conversation
transforms a lookup relation to a (special) product relation. | ||
The indexer $\indexer$ takes as input an index $\idxR = (n, d_f, d_t, t)$; | ||
the prover $\prover$ takes as input the index $\idxR$, instance $\instR = \bot$, | ||
witness $\witR = (f, \addr)$, and the ouput oracles from $\indexer$; |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
output
transforms a permutation relation to a product relation. | ||
The indexer $\indexer$ takes as input an index $\idxR = (n, d, \perm)$; | ||
the prover $\prover$ takes as input the index $\idxR = (n, d, \perm)$, | ||
a witness $\witR = (f, g)$, and the ouput oracles from $\indexer$; |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
output
We construct a PIOP for the indexed relation $\RPLONK$. | ||
The indexer $\indexer$ takes as input the index $\idxR = (n, \ell, \perm, \sel, \tabp)$; | ||
the prover $\prover$ takes as input the index $\idxR$, instance $\instR = \pubinp$, | ||
witness $\witR = \witp$, and the ouput oracles from $\indexer$; |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
output
Close as the paper is already published: https://eprint.iacr.org/2022/1355.pdf |
A short doc explaining the core ideas of Hyperplonk.
close #2