Retry logic when "wheel" is not good enough #2
Commits on Sep 13, 2024
-
Add (failing) test for retry logic
* Also add manual serialisation of Proof + roundtrip test as it cannot be automatically derived anymore * Write a test that crashes because proof cannot be generated * Add a retryCount field for the Proof to implement the logic
-
-
Retry proof an unbounded number of times
Property is a bit long to run as it now needs to repeat the whole proving process several times for a small set.
-
-
-
Replace State monad with ST computation
Even without benchmark, it's obvious from running tests State monad will be unbearably slow
-
Bound DFS with number of hashes in the "small" set case
This completely ditch ST or State monad based computation which are way too expensive.
-
Use different bounds for nr. of hash depending on honest set size
Note the test case does not actually matches the expected theoretical values. The average and max number of proof run should be 1 when n_p is greater than λ³ but it's not the case.
-
-
-
-
Also improve readability of benchmarks' label
-
-
-
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.