code wiki / _hdl_build / nx_infinigen_census_gate.nx
nx_infinigen_census_gate.nx
buildroot/runtime/_hdl_build/nx_infinigen_census_gate.nx
about
nx_infinigen_census_gate.nx -- ★ADVERSARIAL CENSUS vs INFINIGEN (operator 2026-07-10: "really research and
census and adversarial and critic the infinigen so we can get to SOTA with their roadmap"). Method, per the
census doctrine (liar-kill + UI/product axes + measured depth, never vibes):
GROUNDING every axis carries a THEIR-evidence needle that must be FOUND in the banked ifg_* bytes
(knowledge/library/, fetched 2026-07-10 from their repo/papers/docs) -- not memory. Unfound ->
axis UNGROUNDED, excluded from score.
LIAR-KILL every OUR-claim names an artifact FILE the gate opens (source organ / gate / render). Missing
file -> verdict forced to GAP + LIAR flag. No unbacked HAVEs possible.
ADVERSARIAL every candidate HAVE must survive a DEPTH bar (a measured number: archetype counts, feature
presence bits) -- the critic pass that turns "we have trees" into "we have ONE tree archetype
vs their species system -> PARTIAL".
Score: HAVE=1000 PARTIAL=400 GAP=0, mean over grounded axes. Emits knowledge/infinigen_census.txt (report +
the GAP-ORDERED LADDER TO SOTA). license_tier: ORIGINAL expect_exit: 0
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
| 16 | func hw(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 17 | func pn(v: i64) -> i64 { let b: *u8=sys_mmap(32) as *u8; var x: i64=v; var ng: i64=0; if x<0{ng=1;x=0-x} var i: i64=31; if x==0{b[i]=48 as u8;i=i-1} while x>0{b[i]=(48+x%10) as u8;x=x/10;i=i-1} if ng==1{b[i]=45 as u8;i=i-1} sys_write(1,(b as i64+i+1) as *u8,31-i); return 0 } |
| 18 | func slen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } |
| 19 | func contains(buf: *u8, n: i64, needle: *u8) -> i64 |
| 31 | func fexists(path: *u8) -> i64 |
| 38 | func ocat(o: *u8, at: i64, s: *u8) -> i64 { var i: i64=0; var a: i64=at; while s[i]!=(0 as u8){o[a]=s[i]; a=a+1; i=i+1} return a } |
| 39 | func ocatn(o: *u8, at: i64, v: i64) -> i64 |
| 55 | func axis(rep: *u8, ro: *i64, banks: *i64, bankn: *i64, nb: i64, name: *u8, them_src: i64, them_needle: *u8, our_artifact: *u8, has_artifact_credit: i64, depth_ok: i64, critic: *u8, ladder: *u8, sums: *i64) -> i64 |
| 104 | func main() -> i64 |