code wiki / (root) / nx_research_synth_qwen_gate.nx

nx_research_synth_qwen_gate.nx

buildroot/runtime/nx_research_synth_qwen_gate.nx

8535 B123 linesdepth 11pulls 23 transitivereach 0 importersview sourcekind gate/prooftopic research
docsdependenciesstructsconstsfunctions

about

nx_research_synth_qwen_gate.nx -- liar-kill acceptance gate for S1 SOVEREIGN GROUNDED SYNTHESIS. TIER-1 (deterministic, $0, NO model): proves the grounding CHECK DISCRIMINATES a grounded answer from (a) a hallucinated claim (a word present in NO source) and (b) a fabricated citation ([5] with 2 sources). Critic-kernel discipline: a ruler is law only if an adversary built to fool it FAILS. Runs in-session. TIER-2 (marker knowledge/index/rsq_model.on): boots Qwen + generates a REAL synthesis and checks it is grounded. Skipped (gate stays GREEN) when the marker/model is absent -> measured on the NAS. license_tier: ORIGINAL

dependencies 2 imports · 0 importers

nx_research_synth_qwen.nx nx_syscalls.nx nx_research_synth_qwen_gate.nx

imports: nx_research_synth_qwen.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 rsq_ground_report rsq_is_alnum rsq_word_end rsq_is_alnum ↻ rsq_is_stop rsq_eqword rsq_lc rsq_present_in_sources rsq_len rsq_ci_contains rsq_ci_match_at rsq_lc ↻ rsq_len ↻ rsq_parse_cites st_puts sys_write st_putn sys_mmap ↻ sys_write ↻ rsq_is_refusal rsq_ci_contains ↻ rsq_build_prompt rsq_cats rsq_cat rsq_catd rsq_len ↻ rsq_ci_contains ↻ rsq_verdict sys_mmap ↻ rsq_ground_report ↻ rsq_parse_cites ↻ rsq_is_refusal ↻ rsq_claim_verdict sys_mmap ↻ txt_sentence_end rsq_is_alnum ↻ rsq_word_end ↻ rsq_is_stop ↻

structs

none

consts

none

functions

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