code wiki / _hdl_build / nx_competitive_census.nx
nx_competitive_census.nx
buildroot/runtime/_hdl_build/nx_competitive_census.nx
about
nx_competitive_census.nx -- X-CENSUS-001/002/003 (CALLOUT-012, operator 2026-06-13 ANTI-CHEAT law).
The TEAM authors its own competitive census. v3 (MANHEIM-CENSUS-001): CONF-DRIVEN over MANY
incumbents (epigenetics applied to the census itself -- add a competitive_census.conf row = a new
competitive census, ZERO rebuild). Each conf row "C <name> <ref> <out>":
- reads the feature surface from <ref> (bench-reference DATA = the QUESTIONS: feature\tprobe\tunion;
growable, no recompile to add a feature),
- COMPUTES each STATUS (the ANSWER) via re_has against the SHARED nx_ecosystem_test self-model
(the ecosystem's own attestation of what it has PROVEN) -- NEVER tutor-asserted,
- WRITES the census file <out> itself via sys_openat_wr (retires the tutor stdout-redirect),
- emits one CENSUSGATE name=<name> verdict line to stdout (the gate evidence nx_reconcile grades),
- composes nx_benchmark (bm_is_valid completeness gate + honest bm_verdict, refuses cherry-pick).
Self-validating: pos control "divider" MUST compute PRESENT, neg control MUST be ABSENT, else RED.
Argv-free: the sovereign build/run lane drops argv, so CC_CONF is the contract (constant path).
NEXT SLICE (X-CENSUS-003): fetch the LIVE incumbent surface via nx_browse_text (blocked on the
external-HTTPS TLS-FIN path X-B1-FIN-001; local-HTTP fetch is the proven bridge). license_tier: ORIGINAL
dependencies 3 imports · 0 importers
imports: nx_syscalls.nxnx_research_extract.nxnx_benchmark.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
| 19 | const CC_MAGIC_80000: i64 = 80000 |
| 20 | const CC_MAGIC_300000: i64 = 300000 |
| 21 | const CC_MAGIC_200000: i64 = 200000 |
| 22 | const CC_MAGIC_65536: i64 = 65536 |
| 23 | const CC_MAGIC_65520: i64 = 65520 |
| 25 | const CC_SELF: *u8 = "runtime/_hdl_build/nx_ecosystem_test.nx" |
| 26 | const CC_CONF: *u8 = "knowledge/registry/competitive_census.conf" |
| 27 | const CC_LOG: *u8 = "knowledge/status/competitive_census.log" |
| 28 | const CC_MAXF: i64 = 256 |
functions
| 30 | func cc_fw(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 } |
| 31 | func cc_fn(fd: i64, v: i64) -> i64 { let bb: *u8 = sys_mmap(28); var m: i64=v; if m<0 {m=0-m}; 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); 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 } |
| 32 | func cc_msg(s: *u8) -> i64 { return cc_fw(1, s) } |
| 33 | func cc_putn(v: i64) -> i64 { return cc_fn(1, v) } calls 1: cc_fn |
| 35 | func cc_w2(lfd: i64, s: *u8) -> i64 { cc_fw(1, s); if lfd >= 0 { cc_fw(lfd, s) } return 0 } |
| 36 | func cc_n2(lfd: i64, v: i64) -> i64 { cc_fn(1, v); if lfd >= 0 { cc_fn(lfd, v) } return 0 } |
| 38 | func cc_read_file(path: *u8, buf: *u8, cap: i64) -> i64 |
| 53 | func cc_scan_to(buf: *u8, n: i64, start: i64, delim: i64) -> i64 |
| 61 | func cc_scan_ws(buf: *u8, n: i64, start: i64) -> i64 called by 1: main |
| 72 | func cc_app(dst: *u8, off: i64, s: *u8) -> i64 { var i: i64 = 0; while s[i] != (0 as u8) { dst[off+i] = s[i]; i = i + 1 } return off + i } called by 1: cc_one |
| 75 | func cc_vstr(v: i64) -> *u8 called by 1: cc_one |
| 86 | func cc_one(name: *u8, ref: *u8, out: *u8, sm: *u8, smn: i64, lfd: i64) -> i64 |
| 152 | func main() -> i64 |