code wiki / _hdl_build / nx_maturity_auditor_test.nx
nx_maturity_auditor_test.nx source
↩ module page · 38 lines · 2815 B
1// nx_maturity_auditor_test.nx -- prove the evidence-gated maturity ladder. Exit 0 on 9/9. license_tier: ORIGINAL
2
3import "nx_maturity_auditor.nx"
4import "nx_syscalls.nx"
5
6func mt_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 }
7func mt_num(v: i64) -> i64 { let bb: *u8 = sys_mmap(28); var m: i64=v; if m<0{m=0-m}; 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);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 }
8
9func main() -> i64 {
10 mt_puts("=== MATURITY LADDER (evidence-gated) ===\n" as *u8)
11 let absent: i64 = mat_level(0, 0, 0, 0, 0) // not represented
12 let toy: i64 = mat_level(1, 0, 0, 0, 0) // exists, demo only
13 let func_: i64 = mat_level(1, 1, 0, 0, 0) // real inputs, narrow
14 let prod: i64 = mat_level(1, 1, 1, 0, 0) // full surface, hardened
15 let sclass: i64 = mat_level(1, 1, 1, 1, 0) // triangulated parity
16 let exceed: i64 = mat_level(1, 1, 1, 1, 1) // triangulated win
17 let phony: i64 = mat_level(0, 1, 1, 1, 1) // flags set but doesn't exist -> still ABSENT
18
19 mt_puts(" absent=" as *u8); mt_puts(mat_label(absent)); mt_puts(" toy=" as *u8); mt_puts(mat_label(toy)); mt_puts(" func=" as *u8); mt_puts(mat_label(func_)); mt_puts("\n" as *u8)
20 mt_puts(" prod=" as *u8); mt_puts(mat_label(prod)); mt_puts(" sclass=" as *u8); mt_puts(mat_label(sclass)); mt_puts(" exceed=" as *u8); mt_puts(mat_label(exceed)); mt_puts("\n" as *u8)
21 mt_puts(" gap_to_sclass: toy=" as *u8); mt_num(mat_gap_to_sclass(toy)); mt_puts(" prod=" as *u8); mt_num(mat_gap_to_sclass(prod)); mt_puts(" sclass=" as *u8); mt_num(mat_gap_to_sclass(sclass)); mt_puts("\n" as *u8)
22
23 let r: *i64 = sys_mmap(16*8) as *i64
24 r[0]=0; if absent == MAT_ABSENT { r[0]=1 }
25 r[1]=0; if toy == MAT_TOY { r[1]=1 }
26 r[2]=0; if func_ == MAT_FUNCTIONAL { r[2]=1 }
27 r[3]=0; if prod == MAT_PRODUCTION { r[3]=1 }
28 r[4]=0; if sclass == MAT_SCLASS { r[4]=1 }
29 r[5]=0; if exceed == MAT_EXCEED { r[5]=1 }
30 r[6]=0; if phony == MAT_ABSENT { r[6]=1 } // exists-gate blocks phantom promotion
31 r[7]=0; if mat_gap_to_sclass(toy) == 3 { if mat_gap_to_sclass(sclass) == 0 { r[7]=1 } }
32 r[8]=0; if mat_is_sclass_plus(exceed) == 1 { if mat_is_toy(toy) == 1 { if mat_is_absent(absent) == 1 { r[8]=1 } } }
33 var pass: i64 = 0; var i: i64 = 0
34 while i < 9 { pass = pass + r[i]; i = i + 1 }
35 mt_puts(" passed " as *u8); mt_num(pass); mt_puts("/9\n" as *u8)
36 if pass == 9 { mt_puts(" The Auditor can now place every layer on ABSENT->TOY->FUNCTIONAL->PRODUCTION->S-CLASS->EXCEED, evidence-gated.\n" as *u8); sys_exit(0); return 0 }
37 mt_puts(" FAIL\n" as *u8); sys_exit(1); return 1
38}