code wiki / _hdl_build / nx_codec_exceed_gate.nx

nx_codec_exceed_gate.nx

buildroot/runtime/_hdl_build/nx_codec_exceed_gate.nx

9173 B126 linesdepth 3pulls 3 transitivereach 0 importersview sourcekind gate/prooftopic codec

docs dependencies structs consts functions

about

nx_codec_exceed_gate.nx -- SOVEREIGN organ-graded EXCEED census for the patent-free codec arc, vs ffmpeg/x264, AV1, AV2. Embodies the doctrine "S-class exceed = MEASURED, multi-axis, organ-graded, NEVER self-scored": every grade is computed by RULE from evidence, and the rules are proven with NEGATIVE CONTROLS so the census cannot be gamed: * patent-freedom is graded EXCEEDS only when the tool ledger has ZERO active-patent tools (a CABAC in the ledger MUST drop it to BEHIND -- T4 proves it). * the COMPRESSION axis is graded from a REAL head-to-head vs the STRONGEST named reference (x264, H.264 intra): it reports BEHIND honestly when we lose (T3/T5, the anti-overclaim liar-kill) and EXCEEDS only when a measurement genuinely wins on ratio AND quality (T6). Never self-scored. This banks today's PROVABLE wins (0 patented tools / $0 license) while refusing self-congratulation on compression until it is measured vs a reference. GREEN iff 6/6. knowledge/status/codec_exceed_gate.log. license_tier: ORIGINAL

dependencies 2 imports · 0 importers

imports: nx_syscalls.nxnx_gate_emit_lib.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

16	const PROV_EXPIRED: i64 = 1
17	const PROV_PD: i64 = 2
18	const PROV_ACTIVE: i64 = 3
19	const PROV_NOVEL_FTO: i64 = 4
21	const GRADE_ABSENT: i64 = 0
22	const GRADE_BEHIND: i64 = 1
23	const GRADE_PARITY: i64 = 2
24	const GRADE_PENDING: i64 = 3
25	const GRADE_EXCEEDS: i64 = 4

functions

27	func g_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 as u8);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(1,bb,k); return 0 } called by 1: main calls 2: sys_mmap sys_write
28	func g_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 } called by 1: main calls 1: sys_write
29	func g_wn(fd: i64, v: i64) -> i64 { let bb: u8=sys_mmap(28); var m: i64=v; let t: u8=sys_mmap(28); 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; while i<k{bb[i]=t[k-1-i];i=i+1}; sys_write(fd,bb,k); return 0 } called by 1: main calls 2: sys_mmap sys_write
30	func g_grade(g: i64) -> i64 called by 1: main calls 1: g_puts
39	func count_active(prov: *i64, n: i64) -> i64 called by 1: main
45	func grade_patent_freedom(active: i64) -> i64 { if active==0 { return GRADE_EXCEEDS } return GRADE_BEHIND } called by 1: main
47	func grade_license(active: i64) -> i64 { if active==0 { return GRADE_EXCEEDS } return GRADE_BEHIND } called by 1: main
51	func grade_compression(measured: i64, our_ratio: i64, ref_ratio: i64, our_err: i64, ref_err: i64) -> i64 called by 1: main
59	func main() -> i64 calls 14: g_puts sys_mmap count_active grade_patent_freedom grade_license grade_compression+8