code wiki / _hdl_build / nx_researcher_gate.nx
nx_researcher_gate.nx
buildroot/runtime/_hdl_build/nx_researcher_gate.nx
about
nx_researcher_gate.nx -- GATE: the sovereign RESEARCHER that EXCEEDS deep-research by fusing INTERNAL (our own
proprietary banked corpus -- which external systems CANNOT access) + EXTERNAL (diverse authoritative) sources.
Operator 2026-06-26: "i want internal and external sources so we exceed your deep research and other systems."
Internal arm = a DETERMINISTIC term-frequency retriever over the ecosystem's own knowledge (the production ranker
is nx_bm25 -- same deterministic semantics, wired next); external arm = diverse authoritative sources (code-defined,
NO TSV, not Wikipedia-only). The exceeds are structural + measured:
T1 INTERNAL retrieval ranks the relevant doc top (real corpus signal).
T2 PROPRIETARY EXCEED: a Nishi-internal query (NHDL) resolves from OUR corpus -- deep-research cannot (not on the web).
T3 NO-HALLUCINATION: a no-match query returns ZERO (retrieval is faithful; an LLM can fabricate).
T4 DETERMINISM: identical query -> byte-identical scores (deep-research/LLM is stochastic).
+ the honest EXCEED scorecard (4 exceed axes; 2 honestly BEHIND). expect_exit: 0 license_tier: ORIGINAL
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
| 14 | func rw(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 15 | func rn(v: i64) -> i64 { let b: *u8=sys_mmap(28); var m: i64=v; if m<0{sys_write(1,"-" as *u8,1);m=0-m} 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{b[i]=t[k-1-i];i=i+1} sys_write(1,b,k); return 0 } |
| 16 | func rl(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 1: internal_search |
| 17 | func cps(dst: *u8, s: *u8) -> i64 { var i: i64=0; while s[i]!=(0 as u8){ dst[i]=s[i]; i=i+1 } dst[i]=0 as u8; return i } called by 1: main |
| 20 | func tf_count(hay: *u8, hlen: i64, needle: *u8, nlen: i64) -> i64 called by 1: internal_search |
| 37 | func internal_search(docs: *i64, dlens: *i64, ND: i64, term: *u8, scores: *i64, bbox: *i64) -> i64 |
| 50 | func main() -> i64 |