Add CIRCT datapath synthesis benchmarks 2025 #17
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.
A collection of QF_BV benchmarks generated by the CIRCT digital circuit synthesis project. The generated SMT problems check the correctness of lowering Verilog benchmarks to efficient gate-level implementations particularly for arithmetic circuits. The digital circuit synthesis makes use of compressor trees (e.g. Wallace/Dadda trees) to perform addition of many inputs in parallel and as part of multiplication circuits.
Each benchmark is sampled at increasing bitwidth (4-bit, 8-bit and 12-bit), to demonstrate the poor scalability of current bit-blasting tools tested (primarily bitwuzla).