Documentation

Complexitylib.Circuits.DepthThree.LowerBound.Internal.TapeHashInner

Unrestricted depth-three lower bound: tape hash inner #

Adapted from OpenAI's formalization at revision adc7f1241b42e322a6451854ab7e4b4c146bf78a. Source: https://github.com/openai/math/blob/adc7f1241b42e322a6451854ab7e4b4c146bf78a/lean/OAI/Computability/DepthThree/TapeHashInner.lean

Imports, namespaces, module visibility, documentation, and formatting are adapted for complexitylib. The source theorem statements and mathematical proofs are retained.

source
@[reducible, inline]
abbrev Complexity.DepthThreeLowerBound.TapeHashInner.State :
Type

Control states of the hash inner routine.

Equations
Instances For
    source
    def Complexity.DepthThreeLowerBound.TapeHashInner.program :
    TapeMultiProgram State

    Transition function of the hash inner routine.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      source
      def Complexity.DepthThreeLowerBound.TapeHashInner.start :
      State

      Initial control state of the hash inner routine.

      Equations
      Instances For
        source
        def Complexity.DepthThreeLowerBound.TapeHashInner.done :
        State

        Terminal control state of the hash inner routine.

        Equations
        Instances For
          source
          def Complexity.DepthThreeLowerBound.TapeHashInner.progressStore (σ : TapeStore) (i j : ℕ) :
          TapeStore

          Tape-store contents at the progress stage of the hash inner routine.

          Equations
          • One or more equations did not get rendered due to their size.
          Instances For
            source
            theorem Complexity.DepthThreeLowerBound.TapeHashInner.progress_zero (σ : TapeStore) (i : ℕ) (ha : σ TapeRegister.indexA = List.replicate i true) (hb : σ TapeRegister.indexB = []) :
            progressStore σ i 0 = σ
            source
            theorem Complexity.DepthThreeLowerBound.TapeHashInner.progress_step (σ : TapeStore) (i j : ℕ) :
            TapeHashStep.resultStore (progressStore σ i j) i j = Function.update (progressStore σ i (j + 1)) TapeRegister.indexB (List.replicate j true)
            source
            theorem Complexity.DepthThreeLowerBound.TapeHashInner.runs_inner (σ : TapeStore) (i d r : ℕ) (hi : i < r) (hd : σ TapeRegister.dataLength = List.replicate d true) (ha : σ TapeRegister.indexA = List.replicate i true) (hb : σ TapeRegister.indexB = []) (hc : σ TapeRegister.indexC = List.replicate i true) (hkey : (σ TapeRegister.keyBits).length = d + r - 1) (hdata : (σ TapeRegister.dataBits).length = d) (hout : (σ TapeRegister.hashBits).length = r) :
            RunsIn program.step (TapeMultiProgram.cfg start (storeTapes σ)) (TapeMultiProgram.cfg done (storeTapes (progressStore σ i d))) (d * (4 * i + 8 * d + 29) + 4 * d + 8)
            source
            @[simp]
            theorem Complexity.DepthThreeLowerBound.TapeHashInner.program_done (h : TapeHeads) :
            program done h = none