Skip to content

Conversation

matthiasgoergens
Copy link
Contributor

@matthiasgoergens matthiasgoergens commented Dec 16, 2024

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.

Base automatically changed from matthias/saner to master December 18, 2024 10:04
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

1 participant