code wiki / _hdl_build / nx_nofloat_induction_gate.nx

nx_nofloat_induction_gate.nx

buildroot/runtime/_hdl_build/nx_nofloat_induction_gate.nx

8091 B134 linesdepth 3pulls 4 transitivereach 0 importersview sourcekind gate/prooftopic nofloat
docsdependenciesstructsconstsfunctions

about

nx_nofloat_induction_gate.nx -- CONTENT-BASED INDUCTION (CAP-NF-INDUCTION), REBUILT after the 3rd adversarial review showed the old fixed-repeat-position version could be solved by a fixed-offset head (no content match). FIX: the repeated "key" token now appears at a VARYING earlier position p; the target is its FOLLOWER S[p+1]. Context tokens 0..T-2 are DISTINCT (shuffled) so the key matches a unique earlier position. Because p varies, a fixed-offset(-k) head and a fixed-absolute-position head BOTH score ~chance; the ONLY way to win is true content-induction: at the last position, match the current token to its earlier occurrence BY CONTENT, then copy what followed it. Every example fresh-random -> no memorization. 2-block attention (the induction circuit). T1 induction acc (predict S[p+1]) >> chance(1/V) = content-induction works on unseen data. T2 (teeth) acc > copy-back-1 rate (predict S[T-2]) = it is content-match, not a fixed offset. HONEST: research-hard for a tiny fixed-point model; if it only ties chance/copy-back-1 it has NOT earned the word and stays downgraded. The measured numbers are the evidence. Sovereign. expect_exit: 0

dependencies 3 imports · 0 importers

nx_nofloat_autograd.nx nx_syscalls.nx nx_gate_emit_lib.nx nx_nofloat_induction_gate.nx

imports: nx_nofloat_autograd.nxnx_syscalls.nxnx_gate_emit_lib.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main g_puts sys_write sys_mmap dini make_ind lcg ind_fwd nfa_leaf nfa_new nfa_embed nfa_new ↻ nfa_rmsnorm_rows nfa_new ↻ nfa_qmul nfa_isqrt nfa_matmul nfa_new ↻ nfa_rope nfa_new ↻ nfa_fxexp nfa_cosf nfa_reduce2pi nfa_cosq nfa_qmul ↻ nfa_sinf nfa_reduce2pi ↻ nfa_sinq nfa_qmul ↻ nfa_qmul ↻ nfa_matmul_nt nfa_new ↻ nfa_cmul nfa_new ↻ nfa_qmul ↻ nfa_softmax_rows nfa_new ↻ nfa_fxexp ↻ nfa_vadd nfa_new ↻

structs

none

consts

15const Q16: i64 = 65536

functions

18func dini(a: *i64, n: i64, sd: i64) -> i64 { var i: i64=0; while i<n { a[i]=(((i*7+sd*13+1)%11)-5)*13107; i=i+1 } return 0 }
called by 1: main
19func lcg(st: *i64) -> i64 { st[0]=(st[0]*1103515245 + 12345) & 2147483647; return (st[0] >> 15) }
called by 1: make_ind
22func make_ind(S: *i64, tgt: *i64, V: i64, T: i64, st: *i64, arr: *i64, pk: *i64) -> i64
called by 1: main calls 1: lcg
34func ind_fwd(tape: *i64, vals: *i64, st: *i64, W: *i64, ids: *i64, tgt: *i64, T: i64, dm: i64, V: i64, scale: i64, leaves: *i64) -> i64
70func step_all(tape: *i64, grads: *i64, W: *i64, WN: *i64, lnodes: *i64, nW: i64, lr: i64, clip: i64, gb: *i64) -> i64
called by 1: main calls 2: nfa_gradnfa_sgd
76func main() -> i64