-
Following the PR #561 from @gbotrel;
# Problem
Currently, the Groth16 verifier for recursion over 2-Chains of elliptic curves only exposes `Verify()` and `Assign()`. Assigning the proof require…
-
# What's wrong
We currently encrypt plaintext with mimc hashes.
Explore how and why use a Poseidon based encryption/decryption method.
-
In the mimc implementations, this for loop
```
for i := 0; i < nbChunks; i++ {
copy(buffer[:], d.data[i*BlockSize:(i+1)*BlockSize])
x.SetBytes(buffer[:])
r := d.encrypt(x)
d.h.Add(&r, &d…
-
1. Currently, in order to align hash inputs correctly, the user of a Fiat-Shamir transcript has to pad the challenge names so that they are as long as a hashing block. It is desirable for that to be d…
-
I wanted to make a PR but I don't know how Gatsby works so I figured I can leave the code here and let you decide if you'd like to publish it or not.
The idea is to mimc the functionality of the ol…
-
In this circuit:
```
pragma circom 2.0.0;
include "../circomlib/circuits/eddsamimc.circom";
include "../circomlib/circuits/mimc.circom";
template VerifyEdDSAMiMC(k) {
signal input from_x;
…
-
Currently in the process of refactoring into a multi file addon for being able to add new features in a more modular fashion.
-
The [Obsidian app](https://github.com/flathub/md.obsidian.Obsidian) seems to have encountered a networking issue where it cannot successfully reach Github which is impacting its ability to download OT…
-
Hi, I am running this library for exploring how fast is the GPU implementation. Unfortunately, I found GPU is 10 times slower than CPU and I want to know why.
My CPU: Intel(R) Xeon(R) Gold 6145 CPU …
-
Now that NF has moved to Poseidon over SHA, we can do the same. Poseidon is much more efficient in a circuit and it seems like there is also a variable length version we can use for our commitments.
…