code wiki / _hdl_build / nx_llm_gap_registry_test.nx

nx_llm_gap_registry_test.nx

buildroot/runtime/_hdl_build/nx_llm_gap_registry_test.nx

4180 B54 linesdepth 3pulls 3 transitivereach 0 importersview sourcekind gate/prooftopic llm
docsdependenciesstructsconstsfunctions

about

nx_llm_gap_registry_test.nx -- the team records WHERE it needs an LLM (this session's real gaps), the Council flags only the genuine ones, resolved gaps drop out, and a candidate custom LLM is tested against the OPEN gaps -> the residue is exactly what our own LLM must beat. Exit 0 if honest. license_tier: ORIGINAL

dependencies 2 imports · 0 importers

nx_llm_gap_registry.nx nx_syscalls.nx nx_llm_gap_registry_test.nx

imports: nx_llm_gap_registry.nxnx_syscalls.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main gt_puts sys_write sys_mmap lg_status lg_open_count gt_num sys_mmap ↻ sys_write ↻ lg_council_flag lg_custom_ready lg_custom_passes lg_first_unmet lg_custom_passes ↻ sys_exit

structs

none

consts

none

functions

9func gt_puts(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 }
called by 1: main calls 1: sys_write
10func gt_num(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;k=1}; while m>0 {t[k]=48+(m%10); 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 }
called by 1: main calls 2: sys_mmapsys_write
12func main() -> i64