Skip to content
This repository has been archived by the owner on Sep 19, 2024. It is now read-only.

Commit

Permalink
Update README.md
Browse files Browse the repository at this point in the history
  • Loading branch information
erhant authored Dec 25, 2023
1 parent caba421 commit 3508df2
Showing 1 changed file with 1 addition and 3 deletions.
4 changes: 1 addition & 3 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -138,8 +138,6 @@ I use `-vvv` to see reverts in detail.

## Remarks

- This project was done for the [Huff hackathon](https://huff.sh/hackathon)!
- This project was done for the [Huff hackathon](https://huff.sh/hackathon). In the end, I got the [5th place](https://x.com/0xerhant/status/1713974138895847702?s=20)!

- We could also use $p = 2^{160} + 7$, but I wanted all coefficients to be strictly 160-bits, which is not the case with that prime. In fact, the concept works for any prime order, but we would like to use an order that can fit almost all the addresses while being as large as an address.

- Maybe use foundry FFI to generate the basis polynomials during contract creation?

0 comments on commit 3508df2

Please sign in to comment.