code wiki / _hdl_build / nx_reader_exceed_census.nx

nx_reader_exceed_census.nx

buildroot/runtime/_hdl_build/nx_reader_exceed_census.nx

15357 B130 linesdepth 3pulls 3 transitivereach 0 importersview sourcekind tooltopic reader
docsdependenciesstructsconstsfunctions

about

nx_reader_exceed_census.nx -- HONEST measured landscape census: where does the NISHI READER/LIBRARY stand vs KINDLE (devices + apps -- the operator's named rival) and the other s-class reading systems, grounded on the LIVE July-2026 corpus banked TODAY by nx_reader_research_fetch (knowledge/fetched/rdr_z*.raw + reader_x*.raw)? Operator 2026-07-02: "use the nishi researcher to really get where we are vs benchmarks vs july 2026 research on our library and how to beat kindle devices and apps and other s-class systems so we are s-class-exceed like this viewer (kindle only uses as-is pdf where you pinch zoom)." Verdict per axis COMPUTED by xcd_verdict(us,bar) -- NEVER asserted; AHEAD liar-killed unless we meet ALL criteria; SOVEREIGNTY/architecture tagged [FLOOR] (real wins that do NOT by themselves beat Kindle's daily UX). The two quality anchors from TODAY's build: the tiled-pyramid guided-view zoom (gates 6/6 x3 + live /library/zoom HTTP 200 over validated TLS) vs Kindle's as-is PDF pinch. Mirrors nx_deepresearch_census. Scale: 2=full 1=partial 0=absent. license_tier: ORIGINAL expect_exit: 0

dependencies 1 imports · 0 importers

nx_cms_exceed.nx nx_reader_exceed_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