-
### Open Task RFP for Nova by hand
#### Executive Summary
- Project Overview: Provide an implementation/tutorial for individuals to self-construct Nova, and related topics.
#### Project Det…
-
During each layer of grand products we compute a progressively larger multilinear lagrange basis polynomial `EqPolynomial_0(r_0), EqPolynomial_1(r_0, r_1), ... EqPolynomial_n(r_0, r_1, ... r_n)`.
T…
-
Implement the [Transcript](https://github.com/privacy-scaling-explorations/folding-schemes/tree/main/src/transcript) for Keccak.
For the use cases in which we don't need to replicate the transcript i…
-
[`iai-callgrind`](https://lib.rs/crates/iai-callgrind) provides high-precision, high-granularity performance benchmarks of Rust code (using Valgrind under the hood).
It would be nice to have `iai-…
-
-
Hey, I'm inspired by your paper, and after reading it I started playing with the code. I've found out that after [no dsum commit](https://github.com/LBruyne/Collaborative-GKR/commit/3ee1cd1cf9040b2507…
-
Feature gate with "multicore"
-
```[tasklist]
### Tasks
- [x] Algorithm 1 #15 without commitments
- [x] Algorithm 2
- [x] toom cook
```
-
As a part of recursive proof verification, we need to compute random linear combinations of all trace columns for all queried values. Mathematically, this is described as:
$$
\sum_{i=0}^k{\left(\a…
-
If I understand correctly, the current API allows running the sumcheck protocol over products of `DenseMultilinearExtension`.
If one wanted to prove knowledge of evaluations over arbitrary multivaria…