We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
The aim of to understand a different type of authenticated data structure primitive.
The scope is to learn how to have proof of membership in constant size. Why is this inefficient?
cc @jbenet
The text was updated successfully, but these errors were encountered:
@nicola your link to the IntegriDB thing is broken for me
Sorry, something went wrong.
@whyrusleeping updated that now! thanks!
Adding Accumulators for Authenticated Hash Table <- 2016 :)
Adding An Expressive (Zero-Knowledge) Set Accumulator <- 2017
No branches or pull requests
The aim of to understand a different type of authenticated data structure primitive.
The scope is to learn how to have proof of membership in constant size. Why is this inefficient?
Background
Pre-reading (context)
General understanding
Academic review
Usage
Recent/Relevant
cc @jbenet
The text was updated successfully, but these errors were encountered: