code wiki / _hdl_build / nx_room_red.nx
nx_room_red.nx
buildroot/runtime/_hdl_build/nx_room_red.nx
about
nx_room_red.nx -- X-ROOM (overseas-grade): sovereign DETERMINISTIC REDUNDANT AUDIO
(RFC 2198 RED). Each packet piggybacks a COPY of an earlier packet's payload (offset
back by `r`), so an isolated loss is recovered from the redundant copy carried `r`
packets later -- no retransmit (fatal at 250ms overseas RTT), at the cost of extra
bytes. Complements FEC: RED is cheap for sparse isolated loss; FEC covers bursts.
RECOVERY: payload[i] is available iff packet i survived (primary) OR packet i+r
survived (it carries payload[i] as its redundant copy). A burst longer than r leaves
a hole (the honest limit -> that is where nx_room_fec takes over).
EXCEED axis (honest) vs no-redundancy: deterministic recovery of isolated losses with
ZERO retransmit + a TUNABLE offset (recovery span vs added latency), audit-replayable,
sovereign. HONEST SCOPE: single-level RED (one redundant copy / offset r); multi-level
RED + payload-size accounting = deeper rung.
main() is the SELF-VALIDATING GATE. Evidence -> knowledge/status/room_red.log.
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
| 20 | const RED_LOG: *u8 = "knowledge/status/room_red.log" |
functions
| 22 | func rw(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 } |
| 23 | func rwn(fd: i64, v: i64) -> i64 { let bb: *u8 = sys_mmap(28); var m: i64=v; if m<0 {m=0-m; sys_write(fd,"-" 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)) as u8; m=m/10; k=k+1}; var i: i64=0; while i<k {bb[i]=t[k-1-i]; i=i+1}; sys_write(fd, bb, k); return 0 } |
| 26 | func red_unrecoverable(lost: *i64, N: i64, r: i64) -> i64 called by 1: main |
| 40 | func main() -> i64 |