Nat Bunner
@natbunner
Nat Bunner
Vector Commitment completeness says that if C is the commitment to a vector A (where vector a is known to the prover) the prover can produce a proof opening at every point in A that will be accepted by the verifier (for sure, with probability 1)
aPlonK : Aggregated PlonK from Multi-Polynomial Commitment Schemes
eprint.iacr.org
Nova: 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.orgSnarkPack: Practical SNARK Aggregation
eprint.iacr.orgVector Commitment soundness says that for an (adversarily chosen) C, a malicious prover can't open any index to conflicting values
Naive vector commitment: for a collision-resistant function H, commit to x as H(x). To open this commitment, reveal x.
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