[Idea] Use unorderedness of revocation sets for compression.

[bddap]

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?