code wiki / _hdl_build / _evolve_gate_authored.nx
_evolve_gate_authored.nx
buildroot/runtime/_hdl_build/_evolve_gate_authored.nx
about
_evolve_gate_authored.nx -- gate for X-EVO-001. An optimizer you cannot verify is
worse than none, so the gate proves the THREE things that make EC trustworthy:
K1 CONVERGE default config reaches the known optimum (exit 0, final_best=0)
K2 DETERMINISM same seed -> BYTE-IDENTICAL final_best across two runs (the
reproducibility law: seeded EC is replayable, never roulette)
K3 BEATS-RANDOM mutation ON converges where a degenerate run (1 generation =
random init only) does NOT -- evolution is doing real work
K4 MULTIMODAL kind=1 (many basins) still converges (not just the easy sphere)
Markers: EVG-*; final EVGATE row -> knowledge/status/evolve.log
license_tier: ORIGINAL
dependencies 1 imports · 0 importers
imports: nx_syscalls.nx
imported by: nobody (leaf or entry point)
call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown
structs
| none |
consts
| none |
functions
| 12 | func eg_p(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 13 | func eg_f(fd: i64, s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(fd,s,n); return 0 } |
| 14 | func eg_n(fd: i64, v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m; sys_write(fd,"-" as *u8,1)}; let t: *u8=sys_mmap(28); var k: i64=0; if m==0{t[0]=48 as u8;k=1}; while m>0{t[k]=(48+(m%10)) as u8;m=m/10;k=k+1}; var i: i64=0; while i<k{bb[i]=t[k-1-i];i=i+1}; sys_write(fd,bb,k); return 0 } |
| 15 | func eg_ic(dst: *u8, off: i64, v: i64) -> i64 |
| 30 | func eg_run(args: *i64, nargs: i64, outp: *u8, rcout: *i64) -> i64 |
| 58 | func eg_finalbest(path: *u8) -> i64 |
| 88 | func eg_chk(label: *u8, ok: i64, bad: *i64) -> i64 |
| 93 | func main() -> i64 |