code wiki / _hdl_build / nx_ecosysdesign_gate.nx
nx_ecosysdesign_gate.nx
buildroot/runtime/_hdl_build/nx_ecosysdesign_gate.nx
about
nx_ecosysdesign_gate.nx -- EXECUTABLE evidence for the ecosysdesign compare domain (honesty ratchet
2026-07-16: move a claim-only domain to evidence-backed). Re-measures the LIVE dependency graph and
asserts the matrix's load-bearing claims -- NOT a stored number: the store is loaded + queried every run,
so if the design erodes the gate goes RED and the compare page fails. Proves: (1) the graph loads at scale,
(2) nx_syscalls IS the libc-pattern universal base (max fan-in, huge reach, tiny own-imports), (3) nx_tier
is a true gen-0 root (imports nothing), (4) the base's blast radius is the >90% "everything descends"
property. Composes nx_eco_graph. license_tier: ORIGINAL expect_exit:0
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_eco_graph.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
| 11 | func dw(s: *u8) -> i64 { var n:i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 12 | func dn(v: i64) -> i64 { let b:*u8=sys_mmap(24); var m:i64=v; if m<0{sys_write(1,"-" as *u8,1);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 j:i64=0; while j<k{b[j]=t[k-1-j];j=j+1} sys_write(1,b,k); return 0 } |
| 13 | func dslen(s: *u8) -> i64 { var n:i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 1: main |
| 15 | func reach_of(g: *EcoGraph, idx: i64, stamp: *i64, stk: *i64, tag: i64) -> i64 called by 1: main |
| 33 | func main() -> i64 |