Function prove_transparent 

pub fn prove_transparent<'a, A, F, P>(
    alloc: &A,
    gamma: F,
    tables: impl IntoIterator<Item = TableLookup<'a, P>>,
    channel: &mut impl IPProverChannel<F>,
) -> LogupTransparentOutput<F>
where
    A: Allocator,
    F: BinaryField<Underlier: Divisible<u64>>,
    P: PackedField<Scalar = F> + 'a,

Prove a logUp* reduction over transparent tables, leaving the table side open.

This is the prover for binius_ip::logup_star::verify_reduction_transparent, the counterpart of prove for a caller that evaluates its tables itself. It runs the same reduction and stops before the pushforward sumcheck, returning each table’s two open claims on its pushforward.

Arguments

The arguments of prove. The table multilinears are still needed: the reduction reads each one to build its table-side fractional-addition circuit.

Preconditions

The preconditions of prove.