Skip to content

Commit

Permalink
Update BENCHMARKS.md
Browse files Browse the repository at this point in the history
  • Loading branch information
0xWOLAND committed Nov 19, 2023
1 parent 13192c7 commit 50e4a0a
Show file tree
Hide file tree
Showing 2 changed files with 4 additions and 1 deletion.
2 changes: 1 addition & 1 deletion BENCHMARKS.md
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@
## Overview

This benchmark comparison report shows the difference in performance between parallel, NTT-based and serial, brute-force
polynomial multiplication algorithms. Each entry in the first table.
polynomial multiplication algorithms. Each row entry in the first table is an n-degree forward NTT and each row entry in the second table represents an n-degree polynomial multiplication.

Computer Stats:

Expand Down
3 changes: 3 additions & 0 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -30,6 +30,9 @@ fast-ntt is a Rust package to compute polynomial multiplication in `O(nlog(n))`
Generate benchmarks using:

```bash
# If you don't have it already
cargo install cargo-criterion criterion-table

cargo criterion --message-format=json | criterion-table > BENCHMARKS.md
```

Expand Down

0 comments on commit 50e4a0a

Please sign in to comment.