Tomer is an algorithms engineer and researcher at Ingonyama. He holds degrees in Electrical Engineering and Physics from the Technion, and a Ph.D. in Physics from the Weizmann Institute of Science. Tomer has a wide range of experience as an engineer specializing in communications, algorithms, and FPGA design, as well as advanced theoretical physics research. He is a Swing dancer in his spare time.
Includes uses of lookup protocols, Plookup, Cq (like you have never seen before), and the evolution from Plookup to Cq. zk-SNARKs have evolved in recent years focusing mostly on making them more succinct and lowering prover and verifier time. However most SNARKs are still limited to arithmetic operations that can easily be converted to polynomials.
Improving modular multiplication, even by a little bit, can result in significant acceleration…So obviously, we at Ingonyama are obsessed with this problem.