Coarse endpoint concentration at every diverging scale for one-dimensional space-time random walks

For a nearest-neighbor walk on the integers in any fixed independent identically distributed space-time environment whose right-step probabilities lie strictly between zero and one almost surely, we prove superpolynomial concentration of the coarse quenched endpoint law around its averaged law. The intervals may have any deterministic lengths tending to infinity and any deterministic alignments, with no lower growth rate or uniform ellipticity assumption. For every fixed positive discrepancy threshold and every inverse power of time, the corresponding environmental tail is bounded by that inverse power eventually. Constants depend on the fixed law and the eventual threshold may depend on the scale sequence. The theorem gives the affirmative one-dimensional assertion contrary to Conjecture 1 in Noam Berger's contribution to Oberwolfach Report 38/2009. Novelty and historical priority remain unresolved. The bounded audit established no exact full anticipation, but could not access the complete original texts of Boldrighini-Minlos-Pellegrinotti (1999 and 2004), Boldrighini-Pellegrinotti (2001), or Berard (2004). Stronger estimates in those papers have not been eliminated as antecedents. We claim no firstness, independent discovery, new method, or present-day open status. Classical replica, martingale, coalescing and bounded-differences methods are credited, including late-layer and local-corrector precedents of Dunlap-Gu and Barraquand-Rychnovsky. This unrefereed research note was solved, drafted and verified with extensive AI assistance and has not undergone conventional human peer review. The deposit contains a self-contained paper and a portable source and verification archive, with exact finite checks, independent mathematical derivations, historical provenance and a detailed priority ledger. Finite checks supplement the analytic proof; they do not establish the asymptotic theorem or novelty.