code wiki / _hdl_build / nx_team_scorecard_test.nx

nx_team_scorecard_test.nx

buildroot/runtime/_hdl_build/nx_team_scorecard_test.nx

5221 B75 linesdepth 3pulls 3 transitivereach 0 importersview sourcekind gate/prooftopic team
docsdependenciesstructsconstsfunctions

about

nx_team_scorecard_test.nx -- grade the 12 TEAMMATES (organs), run the growth loop, and prove it: the loop deterministically picks the weakest x highest-leverage organ as the next build, the team improves with NO REGRESSION, and converges to all-pass (beating the bar). A simulated regression is caught. This is the loop Claude is tied into. Exit 0 if all hold. license_tier: ORIGINAL

dependencies 2 imports · 0 importers

nx_team_scorecard.nx nx_syscalls.nx nx_team_scorecard_test.nx

imports: nx_team_scorecard.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 tt_puts sys_write sys_mmap tsc_score tt_num sys_mmap ↻ sys_write ↻ tsc_growth_target tsc_all_pass tsc_total_gap tsc_any_regression sys_exit

structs

none

consts

none

functions

9func 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
10func tt_num(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(1, bb, k); return 0 }
called by 1: main calls 2: sys_mmapsys_write
12func main() -> i64