Module Step.Bulletproof

include module type of Pickles_types.Plonk_types.Openings.Bulletproof
type ('g, 'fq) t = {
lr : ('g * 'g) array;
z_1 : 'fq;
z_2 : 'fq;
delta : 'g;
challenge_polynomial_commitment : 'g;
}
val typ : ( 'a, 'b, 'c, ( unit, 'c ) Snarky_backendless.Checked_runner.Simple.t ) Snarky_backendless.Types.Typ.typ -> ( 'd, 'e, 'c, ( unit, 'c ) Snarky_backendless.Checked_runner.Simple.t ) Snarky_backendless.Types.Typ.typ -> length:int -> ( ( 'd, 'a ) t, ( 'e, 'b ) t, 'c ) Snarky_backendless.Typ.t
module Advice : sig ... end

This is data that can be computed in linear time from the proof + statement.