Expand description
logUp* proving with the pushforwards committed as oracles.
The bare reduction returns a claimed evaluation of each table’s pushforward Y = I_* eq_r.
It commits nothing, so those claims cannot be checked on their own.
This layer commits one Y per table over the IOP channel and returns the relations that open
them.
The commits precede the reduction, so its logUp challenges bind the committed oracles.
The tables T and indexes I stay the caller’s oracles, so their claims are returned
unchanged. The pushforwards are the only oracles this protocol introduces, per
[Soukhanov25, Section 3].
prove_transparent is the variant for tables the verifier evaluates itself.
It opens each Y against both eq_z and the table, and so needs no pushforward sumcheck.
Structs§
- Logup
Proof - The reduced claims of a committed logUp* proof.
- Logup
Transparent Proof - The reduced claims of a committed logUp* proof over transparent tables.
- Looker
- One looker’s column and claim:
(I^* T)(eval_point) = eval_claimagainst the table it reads. - Table
Lookup - One table together with the lookers that read it.
Functions§
- prove
- Prove a logUp* reduction whose pushforwards are committed as oracles.
- prove_
transparent - Prove a logUp* reduction over transparent tables, with the pushforwards committed as oracles.