Can a binary code really do correlation generation and polynomial commitments faster, while keeping distance and Lean proofs?
trending9
01 02 Real-world GKR got a Fiat-Shamir attack, and this podcast spends the rest of its time on SP1, Flock, Blaze, and snark.fast.03 Need the paper, Lean 4 proofs, Rust code, and benchmarks for a FRI-folded boolean-kernel PCS?04 Rotor paper: a SNARK for Z_{2^k} rings via multi-precision soundness and tensor-query proximity tests, because fields were too easy.05 ReedWeave adds interleaving to FRI-style folding for Reed-Solomon commitments, chasing faster provers and still polylog checks.06 Optimal proximity gaps for folded linear codes, with FRI-like IOPPs for Reed-Solomon and multiplicity codes.07 Accordion folds arbitrary-degree batch relations into an accumulator, then hands off to a separate SNARK decider, so recursion gets a sma...08 LaBinius swaps binary evals onto lattices, splitting commitment arithmetic from bit arithmetic for Binius/Flock proofs.09 Two group elements open a multivariate polynomial commitment, because apparently size matters more than the prover's dignity.