Sorting with hints #764
Draft
Sorting with hints #764
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
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 an example of using non-deterministic computation in the guest (ie hints) to
sort faster. For one million numbers of input, the new examples takes 25_750_500 cycles to run.
The old sorting example takes around 302_674_458 cycles. (With slight variations depending on how the input is shuffled.)
So hints give us a 10x speedup!
Note: this PR is currently pointed to at the standard-lib-in-guest feature branch, just to make the diff easier to understand. Later we can merge it into
master.