Selective state-space recurrences preserve input-dependent dynamics but complicate reusable computation. This paper connects an exact anchored representation of the unchanged recurrence to two execution decisions: which dynamic transition-summary computations can be removed, and which blocks admit a positive constant anchor under a coordinate-span budget. Feasible-anchor intervals and temporal certificates distinguish repairable failures from failures under every constant anchor. A sharp mean-anchor span bound yields a sharp budget-augmentation guarantee for fixed-tree partitions; a complementary counterexample rules out a width-independent leaf-count approximation at unchanged budget. On 16,384 sampled public-checkpoint roots, block means recover 96.58–99.41% of oracle leaf-count headroom and improve on width-two-only rescue. Matched GPU experiments separate anchor policy from affine/source-only execution. A subsequent evaluation on eight new documents, 130M- and 370M-parameter models, and three layers per model finds that the block-mean policy reduces preparation-inclusive packed-affine latency by 31.3% and 19.5%, respectively, relative to deployed anchors within the same custom executor at the prespecified primary setting. Improvements occur in all 48 model–document–layer cases, with all cases passing full-output numerical checks. Source-only removes specified local-tree arithmetic, while its total-time benefit depends on partition and preparation. These results connect exact coordinate conditions, reusable propagation, and measured policy benefits within the tested execution families.
Thank you for evaluating the paper. I have revised the presentation to make its main contribution clearer: exact conditions for feasible anchored coordinates, sharp anchor-policy guarantees, and a precise account of the transition work that source-only execution removes.
I also added a separate experiment to test a practical consequence of the representation. In its exact form, paired corrections restore token-dependent variation around fixed propagation. The new question is whether every layer needs these corrections for task accuracy. I tested a layerwise delta-warp residual-correction mask, retaining independent state rates; this is an approximation, not an exact-execution speedup. I chose two layers to match the published Based/Zoology MQAR reference depth, with one common training recipe for Native and omission models. In this single-seed experiment, omitting the first-layer correction gives 79.43% example-averaged accuracy. Two same-seed Native executions under the same recipe give 77.91% and 79.62%; their difference is disclosed and unexplained. The omission result is therefore comparable, not an established improvement. Omitting the second-layer correction gives 61.16% and also fits training substantially less well. This provides a concrete learning example and motivates further study of correction placement, while leaving general preservation and optimization effects unresolved.
The layerwise definition and conditional depth bound also apply to four or eight layers; quality and cost at those depths remain unmeasured for this approximation.
The compiled prototype reduces static chunk-loop instructions by 19.3% and shared-memory reservation by 34.6%. Additional local storage, slower complete SCAN and trained-input numerical qualification failures are reported alongside these gains. The paper now distinguishes the established mathematical and resource contributions from the unresolved optimization and broader performance questions.