Content
@
0 reply
0 recast
0 reaction
oskarth
@oskarth.eth
CLIENT SIDE PROVING: How big can circuits for mobile proving be? With Anon-Aadhaar v1 circuits being 1.7m constraints, we wanted to answer this question with Project MoPerf. While there are many performance related concerns the biggest blocker is memory usage. With modern phones with 4GB we can do 1.7m+ constraints.
3 replies
19 recasts
59 reactions
EmpiricalLagrange
@eulerlagrange.eth
https://ethresear.ch/t/lookup-singularity-via-mmr/18704/5 I have a way to speed it up even more. The tradeoff for cryptoeconomic security is unnecessary. You can have infra validate the tables used. Using GKR and Sumcheck you can get a significant boost in batch proving circuits.
1 reply
0 recast
0 reaction
oskarth
@oskarth.eth
What you are talking about is a different approach to circuit design. While interesting, this is orthogonal to the question "how big can circuits (in number of constraints) be on mobile?", with vastly different ways of approaching performance bottlenecks.
1 reply
0 recast
1 reaction
oskarth
@oskarth.eth
A follow up question might be, "Can something like Anon-Aadhaar v1 be done in less than 1.7m constraints with ~equivalent functionality?" The answer is most definitely yes. Different proof systems, more efficient circuits, using lookup tables, folding schemes, other innovative approaches etc. Very different question :)
1 reply
0 recast
1 reaction
EmpiricalLagrange
@eulerlagrange.eth
If all you care about measuring is circuit complexity, then you’re right. I feel like use case complexity might be more interesting. What is rhetorical most complicated zk use case you could implement in a mobile app. Can you go through a year of Robinhood history and derive a ZKP of performance?
1 reply
0 recast
0 reaction
