nx_ncf_recur_gate.nx

nx_ncf_recur_gate.nx -- X-AUT-NCF-001 RUNG 6 (GENERALIZATION, not another special case): synthesize an ORDER-k LINEAR RECURRENCE from ONE parameterized construct (companion / shift-register form). Instead of hand-authoring three-state, four-state, ... as separate rungs, this is a SINGLE construct parameterized by order k -- it SUBSUMES the two-state rung (k=2 = Fibonacci) and covers ANY order (k=3 Tribonacci, k=4 Tetranacci, ...). That is "build intelligence, not special-cases" + a real autonomy point: the team now covers an UNBOUNDED family (every k-nacci / constant-coeff linear recurrence) without a per-order rung. T1 NEG-CONTROL: the two-state rung (k=2 max) FAILS on Tribonacci -> a higher, general order is necessary. T2 SYNTHESIS: the general construct finds Tribonacci at k=3 (c=1,1,1). T3 MATERIALIZE+GOD-BUILD+run HELD-OUT {8->24, 9->44} -> 24044. T4 SUBSUMPTION: the SAME construct fits Fibonacci at k=2 -> it generalizes rung 5 (one construct, many). T5 UNBOUNDED: the SAME construct fits Tetranacci at k=4 -> any order from one parameterized rung. expect_exit: 0 license_tier: ORIGINAL