Documentation

Complexitylib.Algebraic.LowerBound.Cutwidth.Extractor.Strong.Block.Recursion.Scheduled.Matched.Program

Uniform runtime for the matched-width scheduled extractor #

The protocol's supplied scale determines both leaf output width and reserve. The checked guard bounds the depth before any variable power is generated; the complete numerical, seed-width, and payload computations have one uniform FP certificate. Invalid parameters give an empty output. Valid parameters run the existing scheduled bit program with exactly its required seed prefix. At canonical Boolean words the runtime equals matchedBlockExtractor, including when an arbitrary extra seed suffix is supplied.

This is an evaluator for the actual construction. Its statistical guarantee and seed budget are supplied by Scheduled.Matched; no semantic field enumeration or caller-supplied numerical resource premise occurs here.

theorem Algebraic.Cutwidth.Extractor.matchedBlockExtractorRuntime_of_valid (h L e : ℕ) (source seeds : List Bool) (valid : MatchedBlockRuntimeValid source.length h L e) :
matchedBlockExtractorRuntime h L e source seeds = scheduledBlockExtractorBits source.length h (recursiveBlockReserve L (e + h + 2)) (e + h + 2) L source (List.take (scheduledBlockSeedBits source.length h (recursiveBlockReserve L (e + h + 2)) (e + h + 2) L) seeds)

Valid inputs run the prescribed schedule after discarding unused seed padding.

Invalid parameters return the empty word.

The accepted schedule outputs one L-bit word per leaf.

The output width is bounded for every supplied depth, including invalid inputs.

The validity guard is uniformly polynomial-time in its unary parameters.

theorem Algebraic.Cutwidth.Extractor.matchedBlockExtractorRuntime_mem_FP {h L e : List Bool → ℕ} {source seeds : List Bool → List Bool} (hh : Complexity.UnaryFn h) (hL : Complexity.UnaryFn L) (he : Complexity.UnaryFn e) (hsource : source ∈ Complexity.FP) (hseeds : seeds ∈ Complexity.FP) :
(fun (z : List Bool) => matchedBlockExtractorRuntime (h z) (L z) (e z) (source z) (seeds z)) ∈ Complexity.FP

Complete shared-scale extraction is uniformly polynomial-time on arbitrary runtime inputs.

The paired interface reads source and seed words and three unary numerical parameters.

One total paired string evaluator includes all parameter and payload computations.

On canonical words, the runtime computes exactly the actual matched Boolean extractor.

Extra seed padding is ignored, preserving exact agreement with the Boolean extractor.