-
This allows mul to take in an AsRef, and allows one to naturally multiply by a scalar field element.
This does restrict the set of fields that can be scalar fields, since it would have to use u64 a…
-
### Describe the feature request
KZG verification is too slow to use without accelerator/coprocessor/precompile/circuit if we just compile https://github.com/ethereum/c-kzg-4844 in a zkVM.
One w…
-
# Summary
PSE EcoDev had a mini off-site session in February 2024 to work on overhauling the curriculum structure for 2024. The main changes are:
1. Move easy sections to a "pre-requisite" modul…
-
This issue is just to remark a useful variant of Marlin with the property of commit-and-prove. Basically, the verifier does not know the input but instead obtains a commitment of the input. Later, sep…
-
Our current approach to committing on list of neighbors is something like this:
- if A called B and C, compute c_A = g^r.h^A.h_1^B.h_2^C.
If we need to prove that A called B at some point, we will…
-
Figure out how to handle KZG commitments in a circuit.
Requirement for #22
- https://notes.ethereum.org/@dankrad/kzg_commitments_in_proofs
- https://notes.ethereum.org/@vbuterin/proto_dankshard…
-
# INTRO
In many situations, within the verifiable computation paradigm, one is interested, say for example in the context of zkVMs, in whether a certain, global over the execution trace, algebraic re…
-
The tutorial seems to work very well up to part 2. At part 3 right after the `next_fri_polynomial` function is created, the test of `sha256(','.join([str(i) for i in next_p.poly]).encode()).hexdigest(…
-
We don't print out the time used for Poseidon during the proof generation.
```
[2024-09-19T08:20:34Z DEBUG plonky2::util::timing] | 22.4098s to compute all proofs given commitments
[2024-09-19T08:…
-
# Overview
rln-relay consists of the following steps:
1- A membership smart contract must be deployed on the blockchain, the contract holds the list of current registered members (as well as deleted…