-
Currently, one of our MiMC tests checks that encryption is deterministic by comparing the ciphertext of a fixed value and a fixed modulus against a hard-coded value. This only works for a hard-coded m…
-
The best general way to perform a variable-base scalar multiplication in an R1CS circuit, required (before this write-up) [9 constraints per scalar bit](https://github.com/zcash/zcash/issues/2230#issu…
daira updated
3 years ago
-
from https://github.com/zcash/zcash/issues/2230
Ian Miers noticed that a pedersen hash is an exceptionally good application for this fast ECC. Pedersen hashes have been mentioned in papers spanning…
-
This is a casual overview of the payment construction that Matthew, Ian and I have been playing with.
The first intuition is to treat nullifiers as randomized public keys, i.e., (gsk)r where r is t…
-
hi, I think about one solution to short the time to generate proof. I want to decrease the depth (for example set depth 5 rather than 32 )of merkeltree to shorten the time of generating proof. Meanw…
-
Proposed cost model:
* M for a general multiplication (as in R1CS; also the cost of a division);
* m for a constant multiplication (free in R1CS; same as M in Spartan)
* A for an addition/subtrac…
daira updated
3 years ago
-
mini.compile.exclude
配置小程序编译过程中排除不需要经过 Taro 编译的文件,数组类型,写文件路径,文件路径必须以源码所在 src 目录开头:
```js
mini: {
compile:{
// 不编译的文件
exclude:[
'src/utils/mimc_min.js'
]
}
}…
-
Hello, I was trying the trading example in my local machine and started downloading the python dependencies manually as soon as I get some `ModuleNotFoundError`.
At some point I got something like …
-
## Problem
Proving key size is ~110mb for Semaphore. Assuming this is embedded on mobile device, it bloats the APK a lot. Current APK size is ~30mb and even that might be high for people with limit…
-
Version: circom@0.5.7
----
It shows this error when I use v0.5.7 to compile, but it works well at v0.0.34. (I got the same error at v0.0.35.)
```
...circomlib/circuits/mimcsponge.circom:42,4-263,5…