nx_companion_sota.nx
buildroot/runtime/nx_companion_sota.nx
about
nx_companion_sota.nx -- F925: the COMPANION SOTA RULER, measured + LIAR-KILLED.
Doctrine (operator, standing): "SOTA only when MEASURED to beat the tool." A claim that Nishi's companion
is state-of-the-art is worthless self-grading unless every Nishi capability cell is VERIFIED against the
LIVE organ. So this ruler does not assert -- it PROBES nx_elara_state (fork+capture+assert) for each
capability axis, and a claimed HAVE that does not verify makes the whole verdict RED. Competitor cells are
documented capability presence (honest, with a source note); a faked Nishi win cannot survive a failing probe.
Emits a head-to-head MATRIX (Nishi vs Replika / Character.ai / SillyTavern) as JSON, a nishi_leads count,
and verdict=GREEN|RED. `selftest` runs it and asserts the probes verify + verdict GREEN.
Composes ONLY the live companion stack; no GPU (the multimodal axis is HONESTLY marked gpu-gated PARTIAL).
license_tier: ORIGINAL No hw writes (Rule 26).
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_tool_run.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
| 15 | const CS_MAGIC_16384: i64 = 16384 |
| 17 | const CS_ES: *u8 = "/volume1/homes/elderwesto/nishihost/nx_elara_state.elf" as *u8 |
| 18 | const CS_MEM: *u8 = "/volume1/homes/elderwesto/nishihost/nx_elara_memory.elf" as *u8 |
| 19 | const CS_CAP: i64 = 65536 |
functions
| 21 | func cs_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 22 | func cs_len(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 1: cs_contains |
| 23 | func cs_cat(d: *u8, o: i64, s: *u8) -> i64 { var p: i64=o; var i: i64=0; while s[i]!=(0 as u8){ d[p]=s[i]; p=p+1; i=i+1 } return p } |
| 24 | func cs_ch(d: *u8, o: i64, c: i64) -> i64 { d[o]=c as u8; return o+1 } |
| 25 | func cs_udec(d: *u8, o: i64, v: i64) -> i64 called by 1: cs_run_matrix |
| 33 | func cs_contains(buf: *u8, n: i64, needle: *u8) -> i64 |
| 47 | func cs_run2(elf: *u8, nargs: i64, a1: *u8, a2: *u8, a3: *u8, a4: *u8, out: *u8) -> i64 |
| 59 | func cs_run(nargs: i64, a1: *u8, a2: *u8, a3: *u8, a4: *u8, out: *u8) -> i64 |
| 63 | func cs_probe_persistent(buf: *u8) -> i64 |
| 68 | func cs_probe_relational(buf: *u8) -> i64 |
| 73 | func cs_probe_wardrobe(buf: *u8) -> i64 |
| 77 | func cs_probe_grammar(buf: *u8) -> i64 |
| 85 | func cs_probe_flowing(buf: *u8) -> i64 |
| 89 | func cs_probe_context(buf: *u8) -> i64 |
| 94 | func cs_probe_memory(buf: *u8) -> i64 |
| 101 | func cs_lvl(v: i64) -> *u8 { if v==2 { return "HAVE" as *u8 } if v==1 { return "PARTIAL" as *u8 } return "GAP" as *u8 } called by 1: cs_row |
| 102 | func cs_row(out: *u8, o0: i64, first: i64, axis: *u8, nishi: i64, rep: *u8, cai: *u8, st: *u8, note: *u8) -> i64 |
| 116 | func cs_run_matrix() -> i64 |
| 171 | func cs_selftest() -> i64 |
| 179 | func main(argc: i64, argv: *i64) -> i64 |