← → Print all
01 — Proof system · Proof system

Lookup arguments: Plookup, LogUp, cq, Lasso/Shout/Twist

Cross-cutting — often the real cost driver

In one paragraph

Lookup arguments: Plookup, LogUp, cq, Lasso/Shout/Twist: Cross-cutting — often the real cost driver. Lookup arguments prove that values appear in a table, and are how systems express operations that are expensive as raw arithmetic. Maturity: Plookup and LogUp production; structure-exploiting variants research-stage. Maintained by: Plookup: Gabizon and Williamson (Aztec). LogUp: Haböck (Polygon). cq: Eagen, Fiore and Gabizon. Lasso, Twist and Shout: Setty, Thaler and collaborators (a16z crypto). Choose it when: Evaluate the lookup argument explicitly whenever range checks, bitwise operations or instruction decoding dominate your constraint count.

By MarketComp Updated v1.3 About the authors Changelog

What it is

Lookup arguments prove that values appear in a table, and are how systems express operations that are expensive as raw arithmetic. Plookup is the original and ubiquitous; LogUp uses logarithmic derivatives and is substantially cheaper for wide multi-column lookups; cq makes prover cost independent of table size after preprocessing; Lasso and its successors exploit table structure so huge tables need never be materialised.

Strengths and tradeoffs

Strengths
  • Frequently determines prover time more than the choice of headline proof system does
  • LogUp and its GKR variant dominate modern small-field designs
  • Structure-exploiting arguments make instruction-set-sized tables tractable at all
Tradeoffs
  • Plookup scales poorly with large tables and multi-column lookups
  • cq requires a KZG SRS and amortised preprocessing — poor fit for changing tables
  • Structure-exploiting schemes are tied to sumcheck arithmetisations, need decomposable tables to deliver their headline benefits, and their reference implementation is self-declared alpha
  • Multiplicity handling is a known correctness trap: an unconstrained multiplicity column silently breaks soundness

Choose it whenEvaluate the lookup argument explicitly whenever range checks, bitwise operations or instruction decoding dominate your constraint count.

Failure modes that involve it
Maintained implementations

Plookup: Gabizon and Williamson (Aztec). LogUp: Haböck (Polygon). cq: Eagen, Fiore and Gabizon. Lasso, Twist and Shout: Setty, Thaler and collaborators (a16z crypto)

Maturity: Plookup and LogUp production; structure-exploiting variants research-stage · License: n/a (constructions) · eprint.iacr.org ↗

How to decide
Other proof systems in §01
Groth16PLONK and the PLONKish familyFRI-based STARKsHalo2 with IPA, and Halo2 with KZGNova, SuperNova and HyperNovaBinius and binary-field systemsSTIR and WHIRGKR-based systemsSpartanBulletproofs

Sources cited on this page · 3

  1. Plookup — a simplified polynomial protocol for lookup tablespaper
  2. Multivariate lookups based on logarithmic derivatives (LogUp)paper
  3. cq — cached quotients for fast lookupspaper

All 40 sources for §01 are listed on the section page →

Cite this page 
MarketComp (2026). Lookup arguments: Plookup, LogUp, cq, Lasso/Shout/Twist. The ZK Field Manual (Version 1.3). MarketComp. https://zkpick.com/proof-systems/lookup-arguments/
@misc{zkfieldmanual-lookup-arguments-plookup-logup-cq-lasso-,
  title        = {Lookup arguments: Plookup, LogUp, cq, Lasso/Shout/Twist — The ZK Field Manual},
  author       = {MarketComp},
  year         = {2026},
  version      = {1.3},
  howpublished = {\url{https://zkpick.com/proof-systems/lookup-arguments/}},
  note         = {Accessed: YYYY-MM-DD}
}