Skip to content
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

Suffix proofs optimization comment #39

Open
dionyziz opened this issue Jun 27, 2017 · 0 comments
Open

Suffix proofs optimization comment #39

dionyziz opened this issue Jun 27, 2017 · 0 comments

Comments

@dionyziz
Copy link
Owner

We use the notation Q(\epsilon^{|C| - k}\chi). However, this is not explained. Add a textual explanation for this notation and also mention that in an actual implementation, the verifier would only look at \chi and never really construct a fake |C| - k-long prefix.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant