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

Redefine succinctness based on |C| #26

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

Redefine succinctness based on |C| #26

dionyziz opened this issue Jun 27, 2017 · 0 comments

Comments

@dionyziz
Copy link
Owner

Succinctness currently is taken with respect to the number of rounds r. However, it reads more easily to talk about succinctness with respect to the chain size |C|. In particular, we want to say that the NIPoPoW proof size will be \tilde{O}(1) wrt |C| i.e. O(polylog(|C|)).

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