How to Design a Look Up Protocol That Does Not Depend on Table Size

The larger tables you can use, the more proven computation you're going to save. And if you can only use smaller look up tables, I guess you can't put that much in. So interesting trade off there. Can I design a look up protocol where the prover computation does not depend on the table size? Okay. This is what caulk did. Totally, almost totally removed the dependence of prover computation on table size. Which opens up the possibility of using much larger tables. which then would save more prover time. The last one currently in the series is the paper called CQ. It was written with Liam Egan and Dario Fiore.

Transcript

Play full episode

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!

Get the app