Liam Eagen
@liameagen
ID: 2564294568
13-06-2014 00:21:36
28 Tweet
617 Followers
260 Following
1/ Lookups in snarks just got a lot easier! With @LiamEagen and Dario Fiore, we continue the recent sequence of works starting from Caulk, with a new protocol called cq (short for "cached quotients"). eprint.iacr.org/2022/1763
Experimental implementation of ProtoGalaxy using arkworks: github.com/arnaucube/prot… ProtoGalaxy is a new folding scheme by Ariel Gabizon and @LiamEagen which allows to fold k-to-1 instances
New work on folding, with Abhiram Kothapalli! Full paper: eprint.iacr.org/2023/1192.pdf
Introducing Lasso, a new lookup argument that unlocks "lookup singularity" by building on Spartan's sparse polynomial commitment ("Spark"). Appearing on eprint shortly! Joint work with Justin Thaler and Riad Wahby.
Fantastic talk by Liam Eagen at Research Day on how far we can go with verifying over computing. This is the right path to bring arbitrary computation to #Bitcoin & broadly applicable to any peer-to-peer consensus system.
With help from Liam Eagen, I'm pretty sure this construction is broken. The commitment to sum a_iX^i is sum a_i G_i , for public generators G1,..,Gn But the verifier only uses the elements B=sum G_i B_d = sum n^i G_i when checking an evaluation. When n>2, We can use linear