-
Notifications
You must be signed in to change notification settings - Fork 272
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
chore: change the handling of sparse note arrays #6574
Conversation
Benchmark resultsNo base data found for comparison. Detailed resultsAll benchmarks are run on txs on the This benchmark source data is available in JSON format on S3 here. Proof generationEach column represents the number of threads used in proof generation.
L2 block published to L1Each column represents the number of txs on an L2 block published to L1.
L2 chain processingEach column represents the number of blocks on the L2 chain where each block has 16 txs.
Circuits statsStats on running time and I/O sizes collected for every kernel circuit run across all benchmarks.
Stats on running time collected for app circuits
Tree insertion statsThe duration to insert a fixed batch of leaves into each tree type.
MiscellaneousTransaction sizes based on how many contract classes are registered in the tx.
Transaction size based on fee payment method | Metric | | Transaction processing duration by data writes.
|
This is apparently a legitimate failure, I'm trying to understand what causes it. |
An end-to-end test failed because we're filtering before checking for sparseness. We do want to filter, and because that happens in noir we can't rely on the oracle providing post-filter non-sparse values. So this approach won't work at all - closing this PR. |
Instead of returning a new array with the notes collapsed at the beginning, we instead require that the array returned by the oracle has that shape already. This makes the constrain function not change the value being constrained, which is useful for approaching #6543 via noir-lang/noir#4442.