Excellent exposition of cool techniques we used in Aerie!
View quoted post on X
Latest posts 5
It has been a blast working on Aerie!
The performance is imo really unprecedented, and we have more follow-ups to come
The performance is imo really unprecedented, and we have more follow-ups to come
1/ Today we’re releasing Aerie: fast post-quantum signature aggregation, using lattice-based SNARKs for lattice-based Falcon signatures. On a laptop (CPU only), it aggregates roughly a full Ethereum slot’s worth of signatures (32,768) in 0.65 seconds.View quoted post on X
Our latest paper!
We show a number of counterexamples to hoped-for proximity gap conjectures over binary fields
Our strongest one shows failure right beyond what is provable at Johnson bound: super-polynomial list size & bad challenges at vanishing gap from Johnson
We show a number of counterexamples to hoped-for proximity gap conjectures over binary fields
Our strongest one shows failure right beyond what is provable at Johnson bound: super-polynomial list size & bad challenges at vanishing gap from Johnson
1/ Hash-based SNARK proofs are hundreds of KB, too large for many applications. Researchers hoped to halve their size using unproven conjectures. Our new paper rules out this route for binary-field SNARKs.View quoted post on X
With @QuangVDao @skominers @kaizhengcs
eccc.weizmann.ac.il/report/2026/23…
Breakthrough result!
This closes the final gap to have lattice based SNARKs everywhere and for everything
This closes the final gap to have lattice based SNARKs everywhere and for everything
LaBinius: Lattice-based Polynomial Commitment Scheme over a Binary Field.
Excited to present LaBinius, my recent work with @gregor_seiler.
We show how to instantiate an Ajtai commitment over extremely efficient cyclotomic power-of-three rings and then connect it with a polynomial opening mod 2, so that R/2R is a binary field.
Such a PCS is bridged with SOTA frontends, including Flock and Binius, to obtain end-to-end proofs of standard hashes with throughput of tens of thousands per second.
osdnk.me/blog/labiniusView quoted post on X
Happy to announce my latest work with @skominers and @SuccinctJT !
eprint.iacr.org/2026/2056
TLDR: we transfer the techniques from better.codes to yield 5-10% proof size reductions in several SNARKs today, and supply an efficient decoder for knowledge soundness
🧵/ n
eprint.iacr.org/2026/2056
TLDR: we transfer the techniques from better.codes to yield 5-10% proof size reductions in several SNARKs today, and supply an efficient decoder for knowledge soundness
🧵/ n