Skip to content

Commit

Permalink
chore: remove notes on barretenberg optimizations
Browse files Browse the repository at this point in the history
  • Loading branch information
TomAFrench authored Nov 4, 2024
1 parent 9a4f748 commit 15fa22f
Showing 1 changed file with 0 additions and 11 deletions.
11 changes: 0 additions & 11 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -7,14 +7,3 @@ Uses lookup tables and maximally efficient representations of group operations (
Cost of 1 scalar mul = 2232 gates. Marginal cost of additional muls in an msm = 972 gates.

For example usage see `test.nr`

List of potential optimizations to improve performance:

1. update barretenberg backend to identify when memory lookups always come in pairs. e.g. two MEM operations, different ids, read index is the same. backend can convert into 1 memory table with 2 values instead of 2 memory tables with 1 value

```
MEM (id: 1, read at: x1, value: x125)
MEM (id: 2, read at: x1, value: x126)
```

2. fix barretenberg bug where range checks for values <2^{14} create an unneccessary addition gate.

0 comments on commit 15fa22f

Please sign in to comment.