註冊並分享邀請連結,可獲得影片播放與邀請獎勵。

Quang Dao
@QuangVDao
PhD student @SCSatCMU. Working toward zk too cheap to meter & formally verified by default
加入 September 2016
2.2K 正在關注    1.2K 粉絲
Breakthrough result! This closes the final gap to have lattice based SNARKs everywhere and for everything
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.
顯示更多
0
1
110
10
轉發到社區