code wiki / _hdl_build / nx_openpub_census.nx

nx_openpub_census.nx

buildroot/runtime/_hdl_build/nx_openpub_census.nx

13500 B144 linesdepth 4pulls 4 transitivereach 0 importersview sourcekind tool
docsdependenciesstructsconstsfunctions

about

nx_openpub_census.nx -- the HONEST MEASURED starting line for a NISHI answer to apertvs.ai (Apertus, the Swiss AI Initiative's "Fully Open Foundation Model for Sovereign AI"). Drives the GENERAL, reusable nx_capability_census engine: each axis = a DATA ROW (competitor-evidence TERM + our implementing-organ path + our exceed-gate path); the engine grades NEVER self-scored -- them(src) = how many of the sovereign-banked openpub_*.raw sources attest the term (re_has; >=1 noted) us = EXCEEDS (our exceed-gate opens on disk) > PRESENT (our organ opens) > ABSENT [disk facts] verdict = GAP (they have, we ABSENT) | PARITY (both) | AHEAD (we EXCEEDS, or PRESENT & they unattested) The thesis: apertvs.ai wins on OPENNESS (you can SEE weights/data/code). Nishi EXCEEDS on the axis openness can't touch -- SOVEREIGNTY + DETERMINISM (you can REPRODUCE it BYTE-EXACT, from silicon up, with NO third-party runtime). So we expect PARITY across the publish-everything bar (we can publish all they do) and AHEAD across the determinism/sovereignty moat (several MEASURED via a real exceed-gate on disk). GAPS are reported FIRST-CLASS, not hidden: language SCALE (Apertus=1000+ langs) and a training-data PII/memorization-prevention pipeline are genuine ABSENTs today (organ-shaped, named accurately -> honest GAP). GREEN = the MEASUREMENT is honest+grounded (liar-kill armed; graded against a real banked corpus), NOT "we win" -- the scorecard speaks for itself. Run nx_openpub_research_fetch first to bank the corpus. Sovereign nx_cc->nxasm (no gcc, no 3rd-party). expect_exit: 0 license_tier: ORIGINAL

dependencies 2 imports · 0 importers

nx_capability_census.nx nx_syscalls.nx nx_openpub_census.nx

imports: nx_capability_census.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 w sys_write sys_mmap row cc_comp_attest cc_read_file sys_openat_rd sys_read sys_close re_has re_find re_strlen cc_our_grade cc_file_exists sys_openat_rd ↻ sys_close ↻ cc_verdict w ↻ cc_verdict_str cc_grade_str wn w ↻ sys_mmap ↻ sys_write ↻ wn ↻ cc_our_grade ↻ sys_exit

structs

none

consts

19const K_MAGIC_2097152: i64 = 2097152

functions

21func w(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 3: wnrowmain calls 1: sys_write
22func wn(v: i64) -> i64 { var m: i64=v; if m<0{w("-" as *u8);m=0-m} let t:*u8=sys_mmap(24); 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; let o:*u8=sys_mmap(24); while i<k{o[i]=t[k-1-i];i=i+1} sys_write(1,o,k); return 0 }
called by 2: rowmain calls 3: wsys_mmapsys_write
25func row(label: *u8, term: *u8, organ: *u8, exceed: *u8, subj: *i64, ns: i64, buf: *u8, cap: i64, st: *i64) -> i64
41func main() -> i64