LaBinius: lattice-based polynomial commitments hit tens of thousands of hash proofs per second
burny_tech · x · 2026-09-23
Researchers introduce LaBinius, a lattice-based polynomial commitment scheme over a binary field, joint work by Michał Osadnik and Gregor Seiler.
- Key idea: separate the arithmetic used for commitments from that used for evaluation claims — instantiate an Ajtai commitment over efficient cyclotomic power-of-three rings, then connect polynomial openings mod 2 so that R/2R is a binary field
- Bridges with SOTA frontends Flock and Binius, retaining their binary arithmetisations to prove standard bitwise-heavy hashes like Keccak-256, SHA-256 and BLAKE3
- Achieves end-to-end proofs of standard hashes at throughputs of tens of thousands per second
More from Research
- OpenAI forms independent mathematician advisory group to guide AI math research — MarvinTBaumann · 2026-09-23
- Paper suggests transformers can't learn loop-closure in world modeling — burny_tech · 2026-09-23
- Epoch AI: The plunging price of thought — intelligence keeps getting radically cheaper — Proper_Actuary2907 · 2026-09-23
- Open-source RL paper's centering fix questioned as mere gradient recomputation — burny_tech · 2026-09-23
- When AI science bifurcates from human science, like math seems set to do — burny_tech · 2026-09-23
- Physicists Measure e/4 Charge at ν=1/2 in GaAs Well, a First for Even-Denominator FQH States — burny_tech · 2026-09-23