Skip to content

Instantly share code, notes, and snippets.

@shunghsiyu

shunghsiyu/model-checking-bpf-verifier-presentation.ipynb

Last active August 11, 2022 05:24
Show Gist options
  • Save shunghsiyu/a63e08e6231553d1abdece4aef29f70e to your computer and use it in GitHub Desktop.
Save shunghsiyu/a63e08e6231553d1abdece4aef29f70e to your computer and use it in GitHub Desktop.
Download ZIP
Fix description of tnum.mask, and use C-style comment
Display the source blob
Display the rendered blob
Raw
model-checking-bpf-verifier-presentation.ipynb
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
@shunghsiyu
Copy link
Author

Another ideal would be to brute-force through all the combinations at a lower size (i.e. bandwidth), maybe 16-bit instead of 64-bit, then plot some thing like a closure plot (using the posits paper as an example here)

Scratch that... I cannot represent tnum on a single number line

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment