osdnk(@mosdnk):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.

2026.09.22 15:10

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.