code wiki / _hdl_build / nx_deepresearch_census.nx

nx_deepresearch_census.nx

buildroot/runtime/_hdl_build/nx_deepresearch_census.nx

11518 B109 linesdepth 3pulls 3 transitivereach 0 importersview sourcekind tool
docsdependenciesstructsconstsfunctions

about

nx_deepresearch_census.nx -- HONEST measured landscape census: where does the NISHI RESEARCHER stand vs the PUBLISHED deep-research SOTA (June 2026) -- DeepResearcher (GAIR, arXiv 2504.03160, GRPO/Qwen2.5-7B), Tongyi DeepResearch (Alibaba, 30B-A3B MoE), DeepSearcher (Zilliz, Milvus RAG), multimodal-deepresearcher (FDV), and dzhng/deep-research (minimal breadth/depth)? Operator 2026-07-02: "benchmark ... census + evaluate options." Verdict per axis COMPUTED by xcd_verdict(us,bar) -- NEVER asserted; AHEAD liar-killed unless we meet ALL criteria; SOVEREIGNTY/determinism tagged [FLOOR] (a real win that does NOT close the deep-research INTELLIGENCE gap). The "bar" is the cohort's best on that axis, grounded in knowledge/fetched/dr_*.raw (banked by nx_deepresearch_research). Ground truth for the two quality axes = the pre-registered liar-killed 2026-06-20 h2h (SYNTHESIS 0-vs-7, adversarial 0-vs-9). Mirrors the honest nx_researcher_exceed_census; NOT the rigged nx_research_exceed_test. Run SOLO after nx_deepresearch_research + nx_library_harvest_v2. license_tier: ORIGINAL expect_exit: 0

dependencies 1 imports · 0 importers

nx_cms_exceed.nx nx_deepresearch_census.nx

imports: nx_cms_exceed.nx

imported by: nobody (leaf or entry point)

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

main sw row xcd_verdict xcd_referee_ok have sw ↻ xcd_vname sn sn ↻ xcd_referee_ok ↻

structs

none

consts

none

functions

14func sw(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 2: rowmain
15func sn(v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0} 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 }
called by 2: rowmain
16func have(path: *u8) -> i64 { let fd: i64=sys_openat_rd(path); if fd<0 { return 0 } sys_close(fd); return 1 }
called by 1: row
19func row(dom: *u8, cap: *u8, our_c: i64, inc_c: i64, n: i64, ev: *u8, ground: *u8, floor: i64, tot: *i64) -> i64
35func main() -> i64