Binyi Chen
@binyi.bsky.social
Cryptographer
https://chancharles92.github.io/
https://chancharles92.github.io/
Excited to share eprint.iacr.org/2025/1905.pdf that re-envisions how to use folding/accumulation in succinct proof systems.
We provide a new framework to build folding-based SNARKs by eliminating the need to prove Fiat-Shamir inside circuits and by introducing a high-arity lattice folding scheme.
We provide a new framework to build folding-based SNARKs by eliminating the need to prove Fiat-Shamir inside circuits and by introducing a high-arity lattice folding scheme.
eprint.iacr.org
October 17, 2025 at 5:24 PM
Excited to share eprint.iacr.org/2025/1905.pdf that re-envisions how to use folding/accumulation in succinct proof systems.
We provide a new framework to build folding-based SNARKs by eliminating the need to prove Fiat-Shamir inside circuits and by introducing a high-arity lattice folding scheme.
We provide a new framework to build folding-based SNARKs by eliminating the need to prove Fiat-Shamir inside circuits and by introducing a high-arity lattice folding scheme.
eprint.iacr.org/2025/620.pdf
Exciting paper that accelerates Hyperplonk proof generation by 801x over CPUs.
Exciting paper that accelerates Hyperplonk proof generation by 801x over CPUs.
eprint.iacr.org
April 11, 2025 at 4:10 PM
eprint.iacr.org/2025/620.pdf
Exciting paper that accelerates Hyperplonk proof generation by 801x over CPUs.
Exciting paper that accelerates Hyperplonk proof generation by 801x over CPUs.