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.

Noir

Here’s an easy way to get a huge performance boost.

Just precompute a table of lookups you need, and use that as an input (insensitive computation)

With recursion and infra you can then validate the table.

I got a 5x speed gain in this example:

https://github.com/Hmac512/noir-merkle-root-POC-lookup

https://warpcast.com/eulerlagrange.eth/0xedf2debb

Try this strategy for non-sensitive parts of the computation to get better numbers.

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