code wiki / _hdl_build / nx_backlog_loop.nx
nx_backlog_loop.nx
buildroot/runtime/_hdl_build/nx_backlog_loop.nx
about
nx_backlog_loop.nx -- the team WORKS THE BACKLOG ON ITS OWN (operator: "is the team on its own loop to work
the backlog?"). One tick: SCAN the layered backlog in build order -> the BUILDER ATTEMPTS each task by
composition (type-spec in->out over its authored-primitive library) -> COMPOSED => Engineer-gate + governed
BANK; RAISED HAND (-1) => ESCALATE to /tmp/nishi_escalations.log (the tutoring queue Claude works). It is NOT
a blind 24/7 miner (that failure is logged in memory): it works until every remaining task is tutoring-gated,
then STOPS and surfaces the raised hands. After Claude tutors a primitive (marks it available), the next tick
composes the unblocked task. Loop + tutoring alternate = the partnership. license_tier: ORIGINAL
dependencies 1 imports · 0 importers
imports: nx_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
| 14 | const T_NONE:i64=0 |
| 15 | const T_PATH:i64=1 |
| 16 | const T_BYTES:i64=2 |
| 17 | const T_HEX:i64=3 |
| 18 | const T_FIELD:i64=4 |
| 19 | const T_KDF:i64=5 |
| 20 | const T_SAFE:i64=6 |
| 21 | const T_DOM:i64=7 |
| 22 | const NTYPE:i64=8 |
| 23 | const NP:i64=8 |
| 24 | const NTASK:i64=6 |
functions
| 10 | func bl_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 11 | func bl_w(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 } |
| 26 | func bl_reach(cur: i64, target: i64, pin: *i64, pout: *i64, pav: *i64, vis: *i64) -> i64 |
| 37 | func bl_attempt(tin: i64, tout: i64, pin: *i64, pout: *i64, pav: *i64) -> i64 |
| 43 | func main() -> i64 |