code wiki / _hdl_build / nx_ledger_data_gate.nx

nx_ledger_data_gate.nx

buildroot/runtime/_hdl_build/nx_ledger_data_gate.nx

6451 B102 linesdepth 4pulls 5 transitivereach 0 importersview sourcekind gate/prooftopic ledger
docsdependenciesstructsconstsfunctions

about

nx_ledger_data_gate.nx -- ENGINEER gate for LEDGER-AS-DATA (rung AN1). Proves: the .led grammar parses exactly or refuses LOUDLY (malformed/unknown/bad-grade/dangling-ref/dup-T all = 0), the strict independence demotion fires from DATA, narrative-with-value goes BROKEN, the SAME binary yields DIFFERENT verdicts from different files (case = data, no recompile), and the REAL ac_vs_pc_v2.led evaluates to the hand-computed v2 answer. license_tier: ORIGINAL

dependencies 2 imports · 0 importers

nx_ledger_data.nx nx_syscalls.nx nx_ledger_data_gate.nx

imports: nx_ledger_data.nxnx_syscalls.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main sys_mmap ld_parse ld_alloc sys_mmap ↻ ld_line_end ld_line ld_skip sys_mmap ↻ ld_ints sys_mmap ↻ ld_int ld_skip ↻ sg_valid lg_len ld_eval sys_mmap ↻ ld_strict_kinds sys_mmap ↻ an_is_leaf ld_node_support sys_mmap ↻ ld_class_best sg_score_permil sg_valid ↻ sg_rel_permil sg_cred_permil sg_party_permil sg_method_permil sg_has_opposed an_closure_fails an_is_leaf ↻ an_children_sum an_closure_ppm an_narrative_admitted an_traced_cents an_is_leaf ↻ an_traced_permil an_residual_permil an_residual_cents

structs

none

consts

none

functions

9func lg_wf(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
10func lg_wnf(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 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_mmapsys_write
11func lg_len(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n }
called by 1: main
13func main() -> i64