code wiki / _hdl_build / nx_vn_living_gate.nx
nx_vn_living_gate.nx
buildroot/runtime/_hdl_build/nx_vn_living_gate.nx
about
nx_vn_living_gate.nx -- proves the "living but it tracks" limit. LIVING: a provider yields varied interaction
lines across seeds. TRACKS: the validator keeps every FINAL line on-canon (has the fact, never the forbidden) --
and a ROGUE provider (an unbounded/hallucinating LLM that omits the fact or injects a plot-breaking claim) is
REJECTED, falling back to the authored canon line, so the story CANNOT be derailed. Provider-agnostic: the same
limit will bound a sovereign no-float LLM when it plugs in. Prints sample living lines so the result is visible.
license_tier: ORIGINAL expect_exit: 0
dependencies 2 imports · 0 importers
imports: nx_vn_living.nxnx_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
| 10 | func w(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 11 | func wn(v: i64) -> i64 { var m: i64=v; if m<0{w("-" as *u8);m=0-m} let t:*u8=sys_mmap(24); 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; let o:*u8=sys_mmap(24); while i<k{o[i]=t[k-1-i];i=i+1} sys_write(1,o,k); return 0 } |
| 12 | func streq(a: *u8, b: *u8) -> i64 { var i: i64=0; while a[i]!=(0 as u8){ if a[i]!=b[i]{return 0} i=i+1 } if b[i]!=(0 as u8){return 0} return 1 } called by 1: main |
| 14 | func main(argc: i64, argv: *i64) -> i64 |