code wiki / _hdl_build / nx_lifecycle_gate.nx
nx_lifecycle_gate.nx
buildroot/runtime/_hdl_build/nx_lifecycle_gate.nx
about
nx_lifecycle_gate.nx -- GATE: the wear/repair/ETERNAL lifecycle twin on the refrigerator. Parts carry wear-life (days),
part cost, labor cost, replaceable: 0 Compressor(5475d) 1 DoorSeal(1825d) 2 ControlBoard(3650d) 3 SteelShell(10950d).
T1 ETERNAL -- all parts replaceable -> the fridge is eternal (swap each as it wears, forever).
T2 LIMITED -- make the shell non-replaceable -> not eternal; system life capped at the shell's 10950 days.
T3 REPLACE-DAY-- compressor labor($80) > part($45) -> replace at wear-out (X=5475d); a cheap-labor part -> replace early at 80%.
T4 EVOLVING -- replacing the control board with a better one each cycle: cap 100 -> 200 over 4 cycles.
T5 MAINT-COST -- over a 30-year (10950d) horizon the compressor is replaced 2x = 25000c of parts+labor.
T6 NEVER-BRICK-- deterministic.
GREEN iff all. Sovereign nx_cc->nxasm. expect_exit: 0 license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_lifecycle.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 w(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 14 | func wn(v: i64) -> i64 { var m: i64=v; if m<0{w("-" as *u8);m=0-m} let t:*u8=sys_mmap(24); var k:i64=0; if m==0{t[0]=48 as u8;k=1} while m>0{t[k]=(48+(m%10)) as u8;m=m/10;k=k+1} var i:i64=0; let o:*u8=sys_mmap(24); while i<k{o[i]=t[k-1-i];i=i+1} sys_write(1,o,k); return 0 } |
| 16 | func main() -> i64 |