Skip to content
Blockchain LabTHE VENTURE STUDIO

LibraryConfidential compute2023Design paperCorpus record

Jolt: lookups for a virtual machine

Jolt zkVM. Arasu Arun, Srinath Setty and Justin Thaler.

Jolt proposes proving a virtual machine with lookups rather than by arithmetising every instruction into a bespoke constraint system.

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

Jolt proposes proving a virtual machine with lookups rather than by arithmetising every instruction into a bespoke constraint system.
Evidence
Primary paper
Re-measured
No
Assumptions
3
Records linked
2

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 argument proves that an instruction is in a table. It does not, by itself, say whose VM, whose table, or whose inputs.

  2. Claim 02 · Paper model

    The proposal

    Jolt proposes proving a virtual machine with lookups rather than by arithmetising every instruction into a bespoke constraint system.

  3. Claim 03 · Paper model

    The mechanism

    The paper's object is the proof system for a VM. A product that later uses the idea still has to name the instruction set.

  4. Claim 04 · Paper model

    The bound

    This is a research paper. It is not a claim that any network has shipped it unchanged.

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 argument proves that an instruction is in a table. It does not, by itself, say whose VM, whose table, or whose inputs.

    Model

    What has to hold

    You are reading ePrint 2023/1217, not a vendor's proving-service status page.

    Falsifier

    What would retire it

    What machine is the table for?

  2. 02 The proposal

    Observation

    What the study says

    Jolt proposes proving a virtual machine with lookups rather than by arithmetising every instruction into a bespoke constraint system.

    Model

    What has to hold

    You are reading ePrint 2023/1217, not a vendor's proving-service status page.

    Falsifier

    What would retire it

    What machine is the table for?

  3. 03 The mechanism

    Observation

    What the study says

    The paper's object is the proof system for a VM. A product that later uses the idea still has to name the instruction set.

    Model

    What has to hold

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

    Falsifier

    What would retire it

    Is a deployment's verifier the paper's construction or a wrapper around it?

  4. 04 The bound

    Observation

    What the study says

    This is a research paper. It is not a claim that any network has shipped it unchanged.

    Model

    What has to hold

    You are reading ePrint 2023/1217, not a vendor's proving-service status page.

    Falsifier

    What would retire it

    Is a deployment's verifier the paper's construction or a wrapper around it?

03 Sequence

One action, as an operating tape

  1. 01The paper's object is the proof system for a VM. A product that later uses the idea still has to name the instruction set.
  2. 02A lookup table is a finite specification of legal steps. An instruction that is not in the table is not proved by wishing.
  3. 03The paper is not a receipt format and not a blockchain.

04 Load-bearing

The argument, and where a pitch drops it

  1. What the name has to mean

    The cut

    Jolt proposes proving a virtual machine with lookups rather than by arithmetising every instruction into a bespoke constraint system.

    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

    No proving benchmark from a vendor is imported here.

  2. What actually moves

    The cut

    A lookup table is a finite specification of legal steps. An instruction that is not in the table is not proved by wishing.

    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

    Lasso, the lookup argument it builds on, is a related paper and not the same document.

  3. What a later deployment may change

    The cut

    The paper is not a receipt format and not a blockchain.

    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 claim that any network has shipped it unchanged.

05 Register

What has to be true

  • Model · Not re-measured

    You are reading ePrint 2023/1217, not a vendor's proving-service status page.

  • 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

Lasso, the lookup argument it builds on, is a related paper and not the same document.

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 argument proves that an instruction is in a table. It does not, by itself, say whose VM, whose table, or whose inputs.

What the design proposes

  • The paper's object is the proof system for a VM. A product that later uses the idea still has to name the instruction set.
  • A lookup table is a finite specification of legal steps. An instruction that is not in the table is not proved by wishing.
  • The paper is not a receipt format and not a blockchain.

How the mechanism is specified

  • The paper's object is the proof system for a VM. A product that later uses the idea still has to name the instruction set.
  • A lookup table is a finite specification of legal steps. An instruction that is not in the table is not proved by wishing.
  • The paper is not a receipt format and not a blockchain.

What this page does not treat as proven

  • This is a research paper. It is not a claim that any network has shipped it unchanged.
  • No proving benchmark from a vendor is imported here.
  • Lasso, the lookup argument it builds on, is a related paper and not the same document.

Why the desk still reads it

Jolt proposes proving a virtual machine with lookups rather than by arithmetising every instruction into a bespoke constraint system.

09 Lexicon

Terms, opened into the record

Lookup argument
A proof that a value sits in a committed table, used here to check VM steps.
Virtual machine trace
The sequence of steps the proof claims happened.

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.