-
Currently we use MiMC/e7r91 for our merkle trees. MiMC/e7r46, which is less secure but could be 'acceptable', reduces this by about 50%.
This would reduce the number of constraints in our circuits …
-
Hey Harry,
Interesting work you've got going here!
I was looking at using your Solidity implementation of MiMC together with circomlib's javascript implementation, but it doesn't seem to give the…
-
Hi Harry,
In [this post](https://ethresear.ch/t/cheap-hash-functions-for-zksnark-merkle-tree-proofs-which-can-be-calculated-on-chain/3176/10) you say that it may be acceptable to reduce the number …
-
Create tests to cover:
- Solidity MiMC hashing against JS
- State Transition ( State `x` -> snark broadcast -> State `y`)
-
Hey there! Really cool project you've got going on here.
Been playing around with the library lately and noticed some differences in the MiMC implementation compared to ethsnarks'. I made an issue th…
-
We are seeing much lower throughput on high core machines (64 core and the likes) compared to expected roughly linear scaling. This task is about investigating why and proposing possible fixes.
-
Here is a proposed format for balance tree leaves data storage. Where each an independent field element which keeps things simple and they are hashed together with mimc to make the field element which…
-
Currently, to create a STARK transition functions and constraints we need to use JavaScript functions. A better way would be to parse math expressions into these functions automatically.
For exampl…
-
Should the `HttpLoggingInterceptor` log the fully qualified `HttpUrl`?
Currently it [builds the output](https://github.com/square/okhttp/blob/master/okhttp-logging-interceptor/src/main/java/com/squar…
-
Although we are not implementing the SNARK circuit at the moment, we should make sure that we're using a hash function that is SNARK-friendly enough, so that we can batch multiple epochs.
It seems …