code wiki / _hdl_build / nx_search_reach_pulse.nx
nx_search_reach_pulse.nx
buildroot/runtime/_hdl_build/nx_search_reach_pulse.nx
about
nx_search_reach_pulse.nx -- SREACH R4: the DURABLE REACH LOOP step.
Conductor-owned pulse step: re-proves the search arc's two regression gates
EVERY beat -- nx_facet_gate (R2: bits-up facets agree with gold at the
permil bar) and nx_diora_leaderboard (R0/R2: Nishi exceeds EVERY incumbent
on research delivery AND reach, with classifier facets + the content-
accessibility axis live) -- then appends ONE machine-readable verdict row
to knowledge/status/search_reach.log (NTFS-durable, reboot-safe) for the
Examiner's per-arc grading (examiner_arcs.conf row SREACH). So reach is
re-proven per-BEAT, not per-session: a regression anywhere in the ranking /
facet / scoring stack turns the arc RED on the next pulse, evidence-first.
Deliberately NOT in this step: the LIVE-network crawls (R1 guarded reach /
live SERP) -- a beat must be deterministic and offline-green; live reach
re-proves per-arc via nx_diora_live_reach_guarded, never on the clock.
Child-run pattern = nx_team_pulse's tp_run (self-healing): exec the /tmp
sovereign binary; if /tmp was wiped (reboot / concurrent cleanup), fall
back to the durable _offc/nx_sov_build_run.elf which rebuilds from settled
source -- identical judgment, no exec-127 false reds. license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_itoa_lib.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
| none |
functions
| 23 | func _p(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 28 | func _pn(v: i64) -> i64 { nxi_out(v); return 0 } |
| 29 | func _fp(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 } |
| 34 | func _fn(fd: i64, v: i64) -> i64 { nxi_fd(fd, v); return 0 } |
| 35 | func srp_cat(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: srp_run |
| 37 | func srp_run(name: *u8) -> i64 |
| 63 | func main() -> i64 |