@ashutosh
Today we are releasing ligerito-rust (https://github.com/ashutosh1206/ligerito-rust), the experimental pure-Rust (no arkworks) implementation of Ligerito polynomial commitment scheme as well as other common ZK utilities: Ligero, Sumcheck protocol, binary field macros, and more. This work was done in collaboration with Andrija Novakovic from BainCapCrypto and Philipp Jovanovic from UCL (now Mysten Labs).
Currently, benchmarks on this single-core PCS implementation show proving time of 4.3 seconds, verification time of ~320ms and proof size 105KB for polynomials of coefficient size 2^{20} (performed on 2020 M1 MacBook pro). Lots to improve on this front, but we hope to contribute to advancing client-side proving, which was a core motivation behind the original Ligerito paper (https://angeris.github.io/papers/ligerito.pdf).
Lmk what you think!
0 reply
0 recast
1 reaction