For a zkRollup, if you started building a lookup table as you see txs in the mempool you would decrease block prover latency and memory usage significantly.

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

/opacity

and

/eulerlagrange

Given the memory of the prover nodes I don’t think so.

RiscZero uses a different strategy of continuation which won’t be useful for frontrunning.

Builder of things. Dir of Product Research @ Polygon; x: Flow, Augur;

Yes, I can actually write code.

The thing is you don’t need to run multiple zkEVMs in parallel. By lookup table I mean you frontrun specific operations (Keccak, RLP). Which is like a zk microservice.

Then when you prove block validity, you can make assumptions based on the table.

You may be able to get some speedups from non contending operations, but the results for PoS at least showed that parallel EVMs don't really speed up individual block execution dramatically on average.

Thoughts?

For a zkEVM most of the time spent ends up being keccaking and rlp encoding and other state dependent operations.

I don't know if you're going to massively increase the proving time by optimistically proving until you're sequenced.