From 3508df2d3c6d9ace144aa8d830c23414bf825095 Mon Sep 17 00:00:00 2001 From: erhant Date: Mon, 25 Dec 2023 20:26:00 +0300 Subject: [PATCH] Update README.md --- README.md | 4 +--- 1 file changed, 1 insertion(+), 3 deletions(-) diff --git a/README.md b/README.md index 6a1ea43..c6b6cb9 100644 --- a/README.md +++ b/README.md @@ -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?