Documentation

Complexitylib.Metacomplexity.MCSP.Magnification.AntiChecker.Generator.Iteration.Defs

Finite iteration of anti-checker selection rounds -- definitions #

The counter family is indexed by the current labeled-prefix length. This module composes the corresponding width-changing state circuit for any bounded number of rounds, retaining exact types at every intermediate prefix length.

The empty row-major labeled-prefix encoding.

Equations
Instances For

    Reindex the zero-round state width to the bare truth-table width.

    Equations
    Instances For
      def Complexity.GapMCSP.Magnification.AntiCheckerLemma.selectionTraceState {arity rounds : } (target : BitString arityBool) (inputs : Fin roundsBitString arity) :

      Circuit state represented by a target truth table and an ordered vector of target-labeled selected inputs.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For

        Project the input coordinates from the labeled rows carried by a selection state, discarding the preserved truth table and every output label.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For

          Removing the final round preserves the required-round upper bound.

          Counter-family index used by the final step of a nonempty bounded prefix.

          Equations
          Instances For
            noncomputable def Complexity.GapMCSP.Magnification.AntiCheckerLemma.selectionPrefixCircuit {overhead arity : } {beta : PositiveRationalScale} (family : ApproximateCounterFamily overhead beta arity) (rounds : ) :
            rounds requiredRoundCount beta arity(internalGates : ) × Circuit Basis.andOr2 (2 ^ arity) (selectionRoundInputWidth arity rounds) internalGates

            Compose the first rounds counter-selection state transitions.

            Equations
            • One or more equations did not get rendered due to their size.
            Instances For
              noncomputable def Complexity.GapMCSP.Magnification.AntiCheckerLemma.fullSelectionStateCircuit {overhead arity : } {beta : PositiveRationalScale} (family : ApproximateCounterFamily overhead beta arity) :
              (internalGates : ) × Circuit Basis.andOr2 (2 ^ arity) (selectionRoundInputWidth arity (requiredRoundCount beta arity)) internalGates

              State circuit after every required counter-selection round.

              Equations
              • One or more equations did not get rendered due to their size.
              Instances For
                noncomputable def Complexity.GapMCSP.Magnification.AntiCheckerLemma.fullSelectionSamplesCircuit {overhead arity : } {beta : PositiveRationalScale} [NeZero arity] (family : ApproximateCounterFamily overhead beta arity) :
                (internalGates : ) × Circuit Basis.andOr2 (2 ^ arity) (requiredRoundCount beta arity * arity) internalGates

                Full selection circuit with its carried state projected down to the packed input coordinates of the required-round sample vector.

                Equations
                • One or more equations did not get rendered due to their size.
                Instances For