Implement get-compact-range using RFC 6962 methods #18
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
pav-kv
force-pushed
the
get_compact_range
branch
2 times, most recently
from
6f8b72c
to
3d6ac0c
Compare
This is a proof of concept change demonstrating that it is possible to obtain arbitrary compact ranges from a Merkle tree log that restricts itself only to endpoints represented in RFC 6962, in constant time interaction complexity. Specifically, it is possible to obtain comact range [begin, end) by calling "get consistency proof" endpoints <= 2 times for carefully crafted tree sizes. In a few cases where it is impossible to get certain hashes, this approach falls back to calling the "get entries" endpoint 1 time to obtain between 1-3 entries and reconstruct the compact range. Overall, the interaction with the log is limited by 2 calls, and each call is limited in size.
pav-kv
force-pushed
the
get_compact_range
branch
from
3d6ac0c
to
a1036c0
Compare
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This is a proof of concept change demonstrating that it is possible to
obtain arbitrary compact ranges from a Merkle tree log that restricts
itself only to endpoints represented in RFC 6962, in constant time
interaction complexity.
Specifically, it is possible to obtain comact range [begin, end) by
calling "get consistency proof" endpoints <= 2 times for carefully
crafted tree sizes. In a few cases where it is impossible to get certain
hashes, this approach falls back to calling the "get entries" endpoint 1
time to obtain between 1-3 entries and reconstruct the compact range.
Overall, the interaction with the log is limited by 2 calls, and each
call is limited in size.