code wiki / _hdl_build / nx_team_synth_ability.nx
nx_team_synth_ability.nx
buildroot/runtime/_hdl_build/nx_team_synth_ability.nx
about
nx_team_synth_ability.nx -- the TEAM ACQUIRES + WIELDS a general synthesis ABILITY, Teacher-guided
(operator: "build the team's ABILITY to do what you said -- you keep doing it yourself, that's a
cardinal fail; the team must be taught and built and guided toward that capability"). The point is
NOT that a 4-input circuit gets synthesized -- it is that the TEAM holds a GENERAL ability and applies
it to problems Claude did NOT hand-solve:
- the engine (nx_boolsynth4) is GENERAL: it authors a minimal exact circuit for ANY 4-input target.
- the TEAM applies it to a BATTERY of DISTINCT targets and authors all of them by its OWN search
(who wrote the answer? the team's search did -- not a memorized artifact).
- the ENGINEER verifies each EXACTLY (a found circuit means truth-table==target by the bitmask trick).
- the TEACHER GUIDES acquisition: the ability moves M0 (Claude does it) -> M3 (team does it
autonomously, Claude spot-checks) as the team proves it round after round, no regression.
- the EXAMINER grades HONESTLY: beats the naive baseline (real), vs gcc/clang = the triangulation
rung still owed (not claimed S).
license_tier: ORIGINAL
dependencies 3 imports · 0 importers
imports: nx_boolsynth4.nxnx_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
| 20 | func ab_puts(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 } |
| 21 | func ab_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 } |
| 23 | func main() -> i64 |