code wiki / _hdl_build / nx_math_census.nx
nx_math_census.nx
buildroot/runtime/_hdl_build/nx_math_census.nx
about
nx_math_census.nx -- the HONEST math coverage census vs the FULL incumbent inventory
(knowledge/registry/math_incumbent_ref.tsv: DLMF 36 ch + GAMS A-L + Wolfram pillars).
Replaces the 17-row scorecard's misleading "overall=764" (a narrow self-selected slice)
with a TRUE reach permil measured across everything Wolfram/NIST call out. No-wave law:
PRESENT iff the row's <gate> marker is verdict=GREEN in math_engine.log; gate "-" =
ABSENT by construction (we have no gate for it). Weighted reach per category + overall;
EXCEED reads GREEN only at reach=1000 (NIST-EXCEED), else BEHIND with the honest number
and the ABSENT backlog enumerated. Self-validating (pos/neg controls before the real run).
Emits knowledge/registry/math_census.tsv + a MATHCENSUS line (+ ABSENT list) ->
knowledge/status/math_census.log.
module: nishi-core.math.census
depends: nishi-core.sys.syscalls
capability: MATH_COVERAGE_CENSUS_VS_INCUMBENTS
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
| 18 | const MC_MAGIC_524288: i64 = 524288 |
| 19 | const MC_MAGIC_131072: i64 = 131072 |
| 20 | const MC_MAGIC_8192: i64 = 8192 |
| 21 | const MC_MAGIC_7900: i64 = 7900 |
| 23 | const MC_REF: *u8 = "knowledge/registry/math_incumbent_ref.tsv" |
| 24 | const MC_LOG: *u8 = "knowledge/status/math_engine.log" |
| 25 | const MC_MAP: *u8 = "knowledge/registry/math_census.tsv" |
| 26 | const MC_OUT: *u8 = "knowledge/status/math_census.log" |
functions
| 28 | func mc_w(fd: i64, s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(fd,s,n); return 0 } |
| 29 | func mc_wn(fd: i64, v: i64) -> i64 { let bb: *u8=sys_mmap(28); var m: i64=v; if m<0{m=0-m;sys_write(fd,"-" 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)) 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(fd,bb,k); return 0 } |
| 30 | func mc_len(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } called by 1: main |
| 32 | func mc_read(path: *u8, buf: *u8, cap: i64) -> i64 |
| 43 | func mc_tag_green(buf: *u8, n: i64, tag: *u8, tl: i64) -> i64 |
| 72 | func mc_field(buf: *u8, ls: i64, le: i64, f: i64, dst: *u8, cap: i64) -> i64 called by 1: main |
| 86 | func mc_cat(s: *u8) -> i64 called by 1: main |
| 93 | func mc_cpy(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: mc_selftest |
| 94 | func mc_selftest() -> i64 |
| 103 | func main() -> i64 |