code wiki / _hdl_build / nx_teacher_test.nx

nx_teacher_test.nx

buildroot/runtime/_hdl_build/nx_teacher_test.nx

4061 B56 linesdepth 3pulls 3 transitivereach 0 importersview sourcekind gate/prooftopic teacher

docs dependencies structs consts functions

about

nx_teacher_test.nx -- the Teacher sequences the handoff of Claude's work to the team. Roster maps real capabilities to their autonomy rung + the team's grade: fetch M4/90 extract M4/85 BM25 M4/80 corroborate M4/78 <- handed off, team fully owns semantic-cooccurrence M3/70 <- team does it, Claude spot-checks; READY to reach M4 embeddings M0/30 prose M1/40 novel-module M1/35 <- Claude still owns (the LLM rung) The Teacher must: count Claude's remaining load (= the 3 open LLM-gaps), advance the ready rung ONE step (M3->M4), HOLD what's not ready (M0 embeddings stays with Claude), and guard regressions. Exit 0 on 7/7. license_tier: ORIGINAL

dependencies 2 imports · 0 importers

imports: nx_teacher.nxnx_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

none

functions

13	func tt_puts(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 1: main calls 1: sys_write
14	func tt_num(v: i64) -> i64 { let bb: u8 = sys_mmap(28); var m: i64=v; if m<0 {m=0-m; sys_write(1,"-" 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); 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 1: main calls 2: sys_mmap sys_write
16	func main() -> i64 calls 10: tt_puts sys_mmap tch_claude_load tch_handed_off tch_progress_permil tch_next_target+4