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.

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.

zk-pilled or something | Now: http://zkintro.com, folding, mobile proving, etc | Was: Created @vacp2p and @Waku_org | 英文中文都可以

Working on building zkTLS infra/products. A ruthless empiricist and meme connoisseur.

/opacity
/eulerlagrange

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.