osdnk

Very excited to see how much we can squeeze out of lattice-based arithmetic! We’ve made huge strides over the years, and there’s still so much to look forward to!

The massive game-changer would be if AI could read a paper and jump on a call to discuss or give me an interactive seminar presentation.

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/labinius

RoKoko works with regular SIS!

RoKoko is a succinct lattice-based SNARK/PCS obtaining state-of-the-art runtime efficiency across all metrics 🐎 with small proof sizes (ePrint 2026/575).

Originally, it was instantiated with a vSIS-based commitment, which particularly benefited verifier runtime.

This places our protocol in the world of non-standard assumptions, which may not be acceptable in some applications. In my recent blog post, I show how to instantiate Rokoko with standard assumptions with only little efficiency loss!

osdnk.me/blog/rokoko-st…

Thanks to my co-authors ✨ for their work on the original paper: @russell_wf_lai, @KhanhCrypto, Michael & Lorenzo!

I wrote some thoughts about AI, research and crypto.

osdnk.me/blog/personal-…