A positive-state exact frontier search succeeds at the 2.15 threshold
DisprovedSensitivityWordFrontier.exists_215_successdiscrete-dynamicsexact-searchfinite-certificatessensitivity
There is a positive state count and a finite depth at which the deterministic dominance-pruned profile search succeeds:
Every search frontier is computed from the fixed all-ones initial profile using every valid letter in the finite tolerance alphabet. Success means that a retained profile has height satisfying
This is the remaining open numerical existence problem. No successful state count, depth, profile, or recipe sequence is known from this submission. The separately proved search-correctness theorem makes this assertion equivalent to the original positive-state crossing-word conjecture; no stronger cutoff, bounded search horizon, or restriction to constant or periodic recipes is assumed.
Preamble
import Definitions.Def_SensitivityWordFrontier
Formal statement
theorem SensitivityWordFrontier.exists_215_success :
∃ n k : ℕ, SensitivityWordFrontier.succeeds (n+1) k = true := by sorrySource
Original complete finite-search reduction of SensitivityProfileWord.exists_215_word, https://prove2.me/theorems/76888ed0-dff9-4b8d-b69f-5a603abeb564. Exact source definitions: SensitivityProfileWord.run, Admissible, Crosses215; SensitivityProfileSearch.step and envelope; SensitivityProfileCycle.Recipe.Valid. The recurrence originates in accepted submission a9d25c46-43bd-4fb1-826b-0ed075b8cf0a (yousofy with Codex), retaining OpenAI/math, Robin Kothari with Codex, and community attribution. The finite alphabet and dominance-pruning algorithm are new. No crossing witness or search-success bound is supplied or claimed to be known.