Nat Bunner
@natbunner
Nat Bunner
Naive vector commitment: for a collision-resistant function H, commit to x as H(x). To open this commitment, reveal x.
Zero-Knowledge Proof Research | Berkeley RDI
rdi.berkeley.eduNova: Recursive Zero-Knowledge Arguments from Folding Schemes
The document introduces a new approach called Nova for realizing incrementally verifiable computation (IVC) using folding schemes, which are simpler and more efficient than existing techniques.
eprint.iacr.org
There's often a link between the structure of a statement and the structure of its proof.
Vector commitment schemes must satisfy both correctness and soundness
What Every Programmer Should Know About Memory
The document discusses the structure and limitations of memory subsystems in modern commodity hardware, with a focus on CPU caches and how programmers can optimize memory access for performance.
people.freebsd.orgWhat every programmer should know about memory
SnarkPack: Practical SNARK Aggregation
eprint.iacr.org
Vector Commitment soundness says that for an (adversarily chosen) C, a malicious prover can't open any index to conflicting values