Documentation

Complexitylib.Algebraic.LowerBound.Cutwidth.Extractor.Strong.OneShot.Correctness

The one-shot bit program computes the linear statistical composition #

Encoding the decoded explicit condenser recovers its exact runtime word. Hashing that word therefore gives the same map used by the probability argument. For every pair of fixed seeds, this actual map preserves source XOR. The identity holds even outside the fixed-length source promise.

Serialization recovers the exact scheduled condenser output.

theorem Algebraic.Cutwidth.Extractor.decodedOneShotExtractor_eq_composition (n ell e : ℕ) (source : List Bool) (seeds : AdjoinRoot (binaryModulus (oneShotCondenserExponent n ell e)) × AdjoinRoot (binaryModulus (oneShotHashExponent n ell e))) :
let T := explicitCondenserBudget n (ell + 2 * e) (e + 1); let sC := oneShotCondenserExponent n ell e; let sH := oneShotHashExponent n ell e; let m := condenserCoordinates (ell + 2 * e) (sparsePowerBits 1 T); decodedOneShotExtractor n ell e source seeds = binaryFieldHash sH ell (BinaryFieldCodec.decode sH (encodeCondenserOutput sC m (decodedExplicitCondenser n (ell + 2 * e) (e + 1) 1 source seeds.1))) seeds.2

The decoded bit program is condensation, exact serialization, and field hashing.

For fixed seeds, the actual output preserves padded XOR of source words.