-
Notifications
You must be signed in to change notification settings - Fork 234
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
test(avm): minor benchmarking #9869
base: ir/11-03-feat_avm_ephmeral_avm_tree
Are you sure you want to change the base?
test(avm): minor benchmarking #9869
Conversation
Warning This pull request is not mergeable via GitHub because a downstack PR is open. Once all requirements are satisfied, merge this PR as a stack on Graphite.
This stack of pull requests is managed by Graphite. Learn more about stacking. |
4c99c3d
to
d158b08
Compare
fc15d18
to
b57b5e9
Compare
d158b08
to
62c4e45
Compare
b57b5e9
to
060057e
Compare
62c4e45
to
da0ecb5
Compare
060057e
to
ee830d6
Compare
da0ecb5
to
13e10c1
Compare
ee830d6
to
5fe6ae7
Compare
Changes to public function bytecode sizes
🧾 Summary (100% most significant diffs)
Full diff report 👇
|
13e10c1
to
d9eecce
Compare
5fe6ae7
to
1dad3c0
Compare
Changes to circuit sizes
🧾 Summary (100% most significant diffs)
Full diff report 👇
|
d9eecce
to
f152568
Compare
Just a very small micro-benchmark for the a future PR to reference.
This sets up the smallest "worst-case" scenario for the current ephmeral tree implementation.
indexedTreeMin
.a) The DB reads occur because the ephemeral tree doesnt track slots 1 to 127
b) All reads are O(n) as we traverse from min leaf to the low leaf info