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 adds a version of exercise_path_oram that queries consecutive
locations over and over, rather than using the "progressive"
strategy.
the progressive stratey was good initially when we would find bugs
quickly when items are queried again, and it's also good for testing
very large ORAMs in a way that is interesting.
this strategy helps to answer questions posed in issue #12, like,
is it the case that when all items exist in the tree, there is no
space for any dummy blocks, due to our choices of parameters.
In case of such an issue, we would expect this test to fail when
the number of rounds is significantly larger than the size of the
ORAM, because with high probability when an item is mapped
there would be no space on the branch that it selects or in the
stash.