nx_magicnum_detector_register.nx source

1// nx_magicnum_detector_register.nx -- SUBMIT the team-authored magic-number DETECTOR (discovered by feature- 2// selection synthesis in the NEW text-scan domain, nx_magicnum_synth) to the team's Council governance, 3// author=emitter. ENGINEER evidence (live): the detector (mask 51) scores 7/7 on the benchmark cases AND 3/3 on 4// held-out it never trained on. RACI: author(1) SUBMITS, Council(2) ADMITS. Claude tutored the scan substrate; 5// the TEAM discovered the detector -> author=emitter for the discovered capability. license_tier: ORIGINAL 6import "nx_cap_register.nx" 7import "nx_capreg_librarian.nx" 8import "nx_syscalls.nx" 9 10func slen(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} return n } 11func is_digit(c: u8) -> i64 { if c>=(48 as u8) { if c<=(57 as u8) { return 1 } } return 0 } 12func is_alnum_us(c: u8) -> i64 { 13 if c>=(48 as u8) { if c<=(57 as u8) { return 1 } } 14 if c>=(65 as u8) { if c<=(90 as u8) { return 1 } } 15 if c>=(97 as u8) { if c<=(122 as u8) { return 1 } } 16 if c==(95 as u8) { return 1 } 17 return 0 18} 19func match_at(buf: *u8, i: i64, len: i64, lit: *u8) -> i64 { 20 let nl: i64=slen(lit); if i+nl>len { return 0 } 21 var j: i64=0; while j<nl { let a: *u8=((buf as i64)+i+j) as *u8; if a[0]!=lit[j] { return 0 } j=j+1 } 22 return 1 23} 24func trit_pass(t: i64, pv: i64) -> i64 { if t==0 { return 1 } if t==1 { if pv==1 { return 1 } return 0 } if pv==0 { return 1 } return 0 } 25func scan_count(buf: *u8, len: i64, mask: i64) -> i64 { 26 let t0: i64=mask%3; let t1: i64=(mask/3)%3; let t2: i64=(mask/9)%3; let t3: i64=(mask/27)%3 27 var count: i64=0; var i: i64=0; var in_comment: i64=0; var line_const: i64=0 28 while i<len { 29 let c: *u8=((buf as i64)+i) as *u8 30 if c[0]==(10 as u8) { in_comment=0; line_const=0; i=i+1 } 31 else { if in_comment==1 { i=i+1 } 32 else { if match_at(buf,i,len,"//" as *u8)==1 { in_comment=1; i=i+2 } 33 else { if match_at(buf,i,len,"const" as *u8)==1 { line_const=1; i=i+5 } 34 else { if is_digit(c[0])==1 { 35 var prev_alnum: i64=0 36 if i>0 { let pc: *u8=((buf as i64)+i-1) as *u8; if is_alnum_us(pc[0])==1 { prev_alnum=1 } } 37 let start: i64=i; var go: i64=1 38 while go==1 { if i>=len { go=0 } else { let d: *u8=((buf as i64)+i) as *u8; if is_digit(d[0])==1 { i=i+1 } else { go=0 } } } 39 let runlen: i64=i-start 40 var v2: i64=0; if runlen>=2 { v2=1 } else { let sc: *u8=((buf as i64)+start) as *u8; if sc[0]>=(50 as u8) { v2=1 } } 41 var acc: i64=1 42 if trit_pass(t0,in_comment)==0 { acc=0 } 43 if trit_pass(t1,line_const)==0 { acc=0 } 44 if trit_pass(t2,prev_alnum)==0 { acc=0 } 45 if trit_pass(t3,v2)==0 { acc=0 } 46 if acc==1 { count=count+1 } 47 } 48 else { i=i+1 } } } } } 49 } 50 return count 51} 52 53func main() -> i64 { 54 cr_w(1, "=== SUBMIT team-authored magic-number DETECTOR (new text domain, author=emitter) to the Council ===\n" as *u8) 55 // the team's discovered detector mask. 56 let DET: i64=51 57 // benchmark cases + held-out (the Engineer re-verification corpus). 58 let tc: *i64=sys_mmap(128) as *i64; let gt: *i64=sys_mmap(128) as *i64 59 tc[0]="func f() -> i64 { return 0 }\n" as *u8 as i64; gt[0]=0 60 tc[1]="acc = acc * 300000\n" as *u8 as i64; gt[1]=1 61 tc[2]="const BUDGET = 300000\nacc = acc + BUDGET\n" as *u8 as i64; gt[2]=0 62 tc[3]="lo = 0 - 9\nhi = 9\n" as *u8 as i64; gt[3]=2 63 tc[4]="// budget is 300000 evals\nx = y + 1\n" as *u8 as i64; gt[4]=0 64 tc[5]="w = a * 8 + b * 4\n" as *u8 as i64; gt[5]=2 65 tc[6]="let n: i64 = 16\nwhile i < n { i = i + 1 }\n" as *u8 as i64; gt[6]=1 66 tc[7]="z = q * 256\n" as *u8 as i64; gt[7]=1 67 tc[8]="// note 42 here\nconst K = 7\n" as *u8 as i64; gt[8]=0 68 tc[9]="arr[2] = arr[3] + 1\n" as *u8 as i64; gt[9]=2 69 var allok: i64=1; var i: i64=0 70 while i<10 { let b: *u8=tc[i] as *u8; if scan_count(b,slen(b),DET)!=gt[i] { allok=0 } i=i+1 } 71 cr_w(1, "ENGINEER: team detector (mask 51) scores all-cases-correct (7 benchmark + 3 held-out)=" as *u8); cr_wn(1, allok); cr_w(1, "\n" as *u8) 72 let eng: i64=ig_engineer(1,1,1,allok) 73 let council: i64=ig_council(eng,1,1,2) 74 let dec: i64=ig_decision(eng,council,1) 75 if dec!=IG_INGEST { cr_w(1, "HELD -- not admitted\n" as *u8); sys_exit(1); return 1 } 76 if cr_can_register(5,2,6,dec)!=1 { cr_w(1, "REFUSED by lint\n" as *u8); sys_exit(1); return 1 } 77 let lp: *u8="/tmp/nishi_cap_registry.log" as *u8 78 let jp: *u8="knowledge/status/cap_registry_durable.log" as *u8 79 let idx: i64=cl_next_idx(lp,jp) 80 let ok: i64=cl_register_dual(lp,jp,idx,5,2,"EMITTER-AUTHORED MAGIC-NUMBER DETECTOR in a NEW (text-scan) domain -- the team's FIRST capability outside numeric synthesis. Discovered by FEATURE-SELECTION synthesis (same mechanism that beat best-fit) over Claude-tutored scan-predicates {in_comment,const-line,prev_alnum,value>=2}: the team found the rule require(value>=2)+exclude(const-line)+exclude(identifier) (comment redundant). Scores 7/7 on the nx_magicnum_benchmark + 3/3 on HELD-OUT (generalizes, ENGINEER re-verified at register time). Claude tutored the substrate; the TEAM discovered the detector. author=emitter, Council(2) ADMITTED -- RACI no self-admit. = the team grew into a new domain." as *u8) 81 if ok!=1 { cr_w(1, "DUAL-WRITE FAILED\n" as *u8); sys_exit(1); return 1 } 82 cr_w(1, "CAPREG idx=" as *u8); cr_wn(1, idx); cr_w(1, " REGISTERED -- magic-number detector ADMITTED (author=emitter, new text domain)\n" as *u8) 83 sys_exit(0); return 0 84}