code wiki / _hdl_build / nx_cascade_gate.nx
nx_cascade_gate.nx
buildroot/runtime/_hdl_build/nx_cascade_gate.nx
about
nx_cascade_gate.nx -- GATE: the second-life cascade marketplace on a solar panel (30-year life). Tiers:
0 Wealthy/DataCenter (8 yrs, pays $300) -> upgrades for efficiency, passes the panel down
1 MiddleClass (10 yrs, pays $100, gov-subsidized transfer)
2 Poor/Schools/NonProfit (12 yrs, free, gov + non-profit)
T1 FULL LIFE -- 8+10+12 = 30 years used = the panel's whole life.
T2 NO WASTE -- cascade utilization = 1000 permil vs 266 if scrapped after tier 0 (the waste avoided).
T3 PRICE DROPS -- $300 -> $100 -> $0: hardware gets cheaper / free down the cascade.
T4 ENERGY DECLINES -- per-year cost 3750c -> 1000c -> 0c: energy continually cheaper for those below, while the top upgrades.
T5 WIN-WIN-WIN -- 3 tiers served, top upgraded, zero scrap.
T6 NEVER-BRICK -- deterministic.
GREEN iff all. Sovereign nx_cc->nxasm. expect_exit: 0 license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_cascade.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
| 15 | 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 } |
| 16 | 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 } |
| 18 | func main() -> i64 |