nx_research_multilang.nx
buildroot/runtime/nx_research_multilang.nx
about
nx_research_multilang.nx -- ALL-LANGUAGE research coverage (operator: "handle all languages ... so we
TRULY get to physics optimal"). The deepest reason multilingual matters: a HIGHER physics optimum can be
published in ANY language -- a Russian physics preprint, a Chinese materials paper, a Japanese patent, a
declassified non-English report. If the researcher only reads English (~half of indexed output, and a
SMALLER fraction of frontier/grey/declassified work), it can MISS the true optimum and wrongly conclude it
is at the limit. So physics-optimal-GUARANTEED requires covering ~100% of the global research frontier
across languages. This measures the Nishi researcher's current language coverage vs the global research-
output distribution, finds the biggest uncovered gaps, and emits the coverage research program that closes
them -- the multilingual drive that lets the autonomous loop (nx_research_loop) truly reach physics-optimal.
The Nishi search engine searches a query across all COVERED languages; the provability gate (try-to-reproduce)
applies per source regardless of language. Live cross-language FETCH = the delegated step (the web browser);
the coverage measurement + gap + drive + uniform per-language processing are sovereign.
HONEST: language output-weights are REPRESENTATIVE (the SHAPE is real -- English-dominant indexed + a long
multilingual tail incl under-indexed frontier work -- not exact scientometrics). No hw writes (Rule 26).
expect_exit: 0 license_tier: ORIGINAL
dependencies 1 imports · 0 importers
imports: nx_syscalls.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
| none |
functions
| 18 | func ml_puts(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 19 | func ml_num(v: i64) -> i64 { let b: *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{b[i]=t[k-1-i];i=i+1} sys_write(1,b,k); return 0 } |
| 20 | func ml_p(a: *i64, i: i64) -> *u8 { return (a[i]) as *u8 } called by 1: main |
| 22 | func main() -> i64 |