Compare
Four documents, the same five questions.
No throughput league table and no yield. The cells are what this library is willing to say about the text.
| Question | Lasso: lookup arguments for large tables |
|---|---|
| What the text proposes | Lasso proposes lookup arguments that stay cheap even when the table is far larger than the number of lookups, which is the regime a virtual machine needs. |
| Who may write | Srinath Setty, Justin Thaler and Riad Wahby |
| What is settled | The prover shows that queried values sit in a committed table, under the paper's cost model. |
| Load-bearing assumption | This is a research paper. It is not a deployed verifier. |
| What this library says afterwards | A reading of the project's public design document. Not a copy, not a benchmark, and not an offer. |
| Rights | Official external source only |