Threshold normalization for MCSP -- definitions #
Binary thresholds can denote values exponentially larger than their encoded width. MCSP nevertheless has an unconditional circuit-size upper bound that is polynomial in truth-table length. This layer caps thresholds at a concrete bound without changing yes/no semantics and defines the resulting polynomial raw-witness envelope.
Coarse unconditional circuit-size bound for the represented function.
For positive arity this is the square of truth-table length plus two. Arity zero retains the separate size-zero convention.
Instances For
Threshold capped at the unconditional circuit-size upper bound.
Equations
- inst.effectiveThreshold = min inst.threshold inst.trivialCircuitSizeBound
Instances For
Replace an instance's possibly oversized threshold by its effective cap.
Equations
- inst.normalizeThreshold = inst.withThreshold inst.effectiveThreshold
Instances For
Polynomial envelope for a normalized raw-circuit witness, expressed only in the encoded instance length.
Equations
Instances For
Polynomially balanced raw-circuit relation used by the MCSP verifier.
The input must decode canonically, and the witness is checked against the semantics-preserving normalized threshold rather than an arbitrarily large binary threshold from the input.
Equations
- Complexity.MCSP.RawWitnessRelation bits witness = match Complexity.MCSP.Instance.decode? bits with | none => False | some inst => inst.normalizeThreshold.IsRawCircuitWitness witness