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.

Sign up for GitHub

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

Jump to bottom

[Idea] Use unorderedness of revocation sets for compression. #24

Open

bddap opened this issue Apr 7, 2020 · 0 comments

Contributor

bddap commented Apr 7, 2020

https://www.google.com/search?q=compressed+representation+of+a+set reveals a number of compression methods for unordered lists. We may be able to achieve very low chainstate usage using one of those methods, or similar.

Does Substrate's merkle-trie already achieve good compression?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment