Skip to content
Blockchain LabTHE VENTURE STUDIO

LibraryConfidential compute2022Design paperCorpus record

Lasso: lookup arguments for large tables

Lasso lookups. Srinath Setty, Justin Thaler and Riad Wahby.

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.

A reading of the project's public design document. Not a copy, not a benchmark, and not an offer.

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.
Evidence
Primary paper
Re-measured
No
Assumptions
3
Records linked
1

01 Claim ledger

What the paper is allowed to say

Each row is a sentence already in the study. The status is the same on every row: a model claim, not a live measurement.

  1. Claim 01 · Paper model

    The defect

    A lookup proves membership in a table. The table is the specification of legal behaviour. A wrong table is a wrong machine, proved efficiently.

  2. Claim 02 · Paper model

    The proposal

    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.

  3. Claim 03 · Paper model

    The mechanism

    The prover shows that queried values sit in a committed table, under the paper's cost model.

  4. Claim 04 · Paper model

    The bound

    This is a research paper. It is not a deployed verifier.

02 Three cuts

Observation, model, falsifier

A desk does not stop at the summary. Each claim is cut three ways, using only this study's own assumptions and checks. Nothing here is a new figure.

  1. 01 The defect

    Observation

    What the study says

    A lookup proves membership in a table. The table is the specification of legal behaviour. A wrong table is a wrong machine, proved efficiently.

    Model

    What has to hold

    You are reading ePrint 2022/1752. Jolt is the separate VM paper.

    Falsifier

    What would retire it

    What is the table a commitment to?

  2. 02 The proposal

    Observation

    What the study says

    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.

    Model

    What has to hold

    The document is the one at the source URL. A marketing page with the same brand is not this text.

    Falsifier

    What would retire it

    What is the table a commitment to?

  3. 03 The mechanism

    Observation

    What the study says

    The prover shows that queried values sit in a committed table, under the paper's cost model.

    Model

    What has to hold

    You are reading ePrint 2022/1752. Jolt is the separate VM paper.

    Falsifier

    What would retire it

    Is the system you are reviewing this paper, or a VM paper that cites it?

  4. 04 The bound

    Observation

    What the study says

    This is a research paper. It is not a deployed verifier.

    Model

    What has to hold

    You are reading ePrint 2022/1752. Jolt is the separate VM paper.

    Falsifier

    What would retire it

    Is the system you are reviewing this paper, or a VM paper that cites it?

03 Sequence

One action, as an operating tape

  1. 01The prover shows that queried values sit in a committed table, under the paper's cost model.
  2. 02The verifier's work is not supposed to grow with the full table the way a naive approach would. That is the paper's claim, inside its model.
  3. 03Jolt is a VM built using this idea. Lasso is not Jolt.

04 Load-bearing

The argument, and where a pitch drops it

  1. What the name has to mean

    The cut

    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.

    Why it carries weight

    If this cut is skipped, the paper's name is being used without the mechanism that makes the name mean anything.

    Where it is dropped

    A lookup does not prove that the table encodes the instruction set you intended.

  2. What actually moves

    The cut

    The verifier's work is not supposed to grow with the full table the way a naive approach would. That is the paper's claim, inside its model.

    Why it carries weight

    If this cut is skipped, the paper's name is being used without the mechanism that makes the name mean anything.

    Where it is dropped

    This is a research paper. It is not a deployed verifier.

  3. What a later deployment may change

    The cut

    Jolt is a VM built using this idea. Lasso is not Jolt.

    Why it carries weight

    If this cut is skipped, the paper's name is being used without the mechanism that makes the name mean anything.

    Where it is dropped

    A later client, parameter or reward formula is a different object from this paragraph.

05 Register

What has to be true

  • Model · Not re-measured

    You are reading ePrint 2022/1752. Jolt is the separate VM paper.

  • Model · Not re-measured

    The document is the one at the source URL. A marketing page with the same brand is not this text.

  • Model · Not re-measured

    No price, supply, yield, or adoption figure is added by this desk.

06 Divergence

What happened after the paper

A lookup does not prove that the table encodes the instruction set you intended.

A later client, parameter set, or reward formula is a different object. Cite this paper for the mechanism. Cite a primary release for the network. This desk has not re-run the proof.

07 Pre-mortem

What to check before you use the idea

  4. 0 of 3 marked on this browser. A mark is a reading note, not a pass, a rating, or a recommendation.

08 Anatomy

The paper, in the order a builder needs

The problem it names

A lookup proves membership in a table. The table is the specification of legal behaviour. A wrong table is a wrong machine, proved efficiently.

What the design proposes

  • The prover shows that queried values sit in a committed table, under the paper's cost model.
  • The verifier's work is not supposed to grow with the full table the way a naive approach would. That is the paper's claim, inside its model.
  • Jolt is a VM built using this idea. Lasso is not Jolt.

How the mechanism is specified

  • The prover shows that queried values sit in a committed table, under the paper's cost model.
  • The verifier's work is not supposed to grow with the full table the way a naive approach would. That is the paper's claim, inside its model.
  • Jolt is a VM built using this idea. Lasso is not Jolt.

What this page does not treat as proven

  • This is a research paper. It is not a deployed verifier.
  • No speed figure is imported.
  • A lookup does not prove that the table encodes the instruction set you intended.

Why the desk still reads it

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.

09 Lexicon

Terms, opened into the record

Lookup
A proof that a value is in a table.
Table
The finite specification being looked up. It is part of the statement.

10 Repository

Every linked record on this page

Underlined words open a page that already exists: a concept, a protocol profile, a failure record, or another paper. If a word is not underlined, this desk does not have a record for it.

This is Blockchain Lab's reading of a public design paper. It is not the paper, not a copy of it, and not an offer of tokens, equity, custody or a partnership. Later network behaviour can diverge from the text. Nothing here is investment, legal or technical advice.

Research status: Design paper. Last reviewed: 1 October 2026. This is a reading of a public paper, not investment, legal or security advice.