code wiki / _hdl_build / nx_game_asset_census.nx
nx_game_asset_census.nx
buildroot/runtime/_hdl_build/nx_game_asset_census.nx
about
nx_game_asset_census.nx -- HONEST competitive census of the ecosystem's AUTONOMOUS GAME-BUILDING asset
generation vs the incumbents the operator named: LPC (2D layered sprites), Being-a-DIK/DAZ (offline 3D
characters), Unreal/MetaHuman (real-time 3D). Built-status is DERIVED from real organ files (org_resolve,
like nx_ng_gap) -- never hardcoded. The 14-rung neural-graphics ladder is PROVEN (nx_ng_gap 14/14) but at
PoC scale (1D/Q16/1-DOF); this census frames it against the incumbents + names the buildable rungs.
verdicts: EXCEED = sovereign approach the incumbent structurally can't match; HAVE = primitive proven,
production-scale is the follow-on; GAP = organ not yet built (the next S-class rung). license_tier: ORIGINAL
census-subject: product-surface
INSTRUMENT-UPGRADED 2026-07-10: + UI/PRODUCT AXES vs dated banked bars (pb_godot/luanti/veloren 2026-07-09,
rh_ repo-health 2026-07-10) -- asset OUTPUT quality vs what those products SHIP, additive to the rung grading.
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
| 13 | func gc_p(s: *u8) -> i64 { var n:i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 14 | func gc_pn(v: i64) -> i64 { let bb:*u8=sys_mmap(28); var m:i64=v; if m<0{m=0-m;sys_write(1,"-" 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(1,bb,k); return 0 } |
| 15 | func gc_exists(path: *u8) -> i64 { let fd:i64=sys_openat_rd(path); if fd<0{return 0} sys_close(fd); return 1 } |
| 16 | func gc_join(pfx: *u8, name: *u8, out: *u8) -> i64 { var o:i64=0; var i:i64=0; while pfx[i]!=(0 as u8){out[o]=pfx[i];o=o+1;i=i+1} i=0; while name[i]!=(0 as u8){out[o]=name[i];o=o+1;i=i+1} out[o]=0 as u8; return 0 } called by 1: gc_resolve |
| 17 | func gc_resolve(name: *u8) -> i64 |
| 24 | func gc_axis(cnt: *i64, name: *u8, organ: *u8, incumbent: *u8, note: *u8, klass: i64) -> i64 |
| 36 | func main() -> i64 |