nx_search_competitor_census.nx
buildroot/runtime/nx_search_competitor_census.nx
about
nx_search_competitor_census.nx -- the SEARCH lane's COMPETITOR-FEATURE census: how much of the incumbent
(Ecosia/DDG/Bing/Google/Brave/Mojeek/Kagi) feature UNION does the sovereign engine already have? Data-driven over
knowledge/registry/search_competitor_features.conf (add a row = a graded feature, ZERO rebuild). Each feature reads
PRESENT iff its proving SEARCH gate log's last verdict is GREEN (gate-derived via nx_gate_green -- NEVER asserted,
the anti-cheat law); a BUILD-TARGET (gate="-") reads ABSENT with the incumbents that have it. Prints per-LADDER-TIER
rollup (mojeek < ddg < bing < google) so we see exactly which competitor tier we've matched + where the climb is.
Grades from the SEARCH gate logs (NOT the substrate self-model -- that would false-ABSENT every search capability).
Composes nx_gate_green (the scorecard's proven line-judge). Durable -> knowledge/status/search_competitor_census.log.
license_tier: ORIGINAL
dependencies 3 imports · 0 importers
imports: nx_str.nxnx_syscalls.nxnx_gate_green.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
| 13 | const SCC_MAGIC_65536: i64 = 65536 |
| 14 | const SCC_MAGIC_65520: i64 = 65520 |
| 15 | const SCC_MAGIC_200000: i64 = 200000 |
| 17 | const SCC_CONF: *u8 = "knowledge/registry/search_competitor_features.conf" |
| 18 | const SCC_OUT: *u8 = "knowledge/registry/search_competitor_census.tsv" |
| 19 | const SCC_LOG: *u8 = "knowledge/status/search_competitor_census.log" |
functions
| 21 | func scp(s: *u8) -> i64 { sys_write(1, s, nx_str_len(s)); return 0 } |
| 22 | func scn(v: i64) -> i64 { if v==0 { sys_write(1,"0" as *u8,1); return 0 } var m: i64=v; if m<0 { sys_write(1,"-" as *u8,1); m=0-m } let t: *u8=sys_mmap(28); var k: i64=0; while m>0 { t[k]=48+(m%10); m=m/10; k=k+1 } while k>0 { k=k-1; sys_write(1,(((t as i64)+k) as *u8),1) } return 0 } |
| 23 | func scw(fd: i64, s: *u8) -> i64 { if fd>=0 { sys_write(fd, s, nx_str_len(s)) } return 0 } |
| 24 | func scfn(fd: i64, v: i64) -> i64 { let b: *u8=sys_mmap(28); let t: *u8=sys_mmap(28); var m: i64=v; if m<0 { m=0-m } 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 { b[i]=t[k-1-i]; i=i+1 } if fd>=0 { sys_write(fd,b,k) } return 0 } |
| 26 | func scc_read(path: *u8, buf: *u8, cap: i64) -> i64 |
| 32 | func scc_scan_to(buf: *u8, n: i64, start: i64, delim: i64) -> i64 called by 1: main |
| 37 | func scc_streq(a: *u8, b: *u8) -> i64 { var i: i64=0; while a[i]!=(0 as u8) { if a[i]!=b[i] { return 0 } i=i+1 } if b[i]!=(0 as u8) { return 0 } return 1 } |
| 38 | func scc_app(dst: *u8, off: i64, s: *u8) -> i64 { var i: i64=0; while s[i]!=(0 as u8) { dst[off+i]=s[i]; i=i+1 } return off+i } called by 1: main |
| 40 | func scc_tier_idx(t: *u8) -> i64 |
| 50 | func scc_tier_name(i: i64) -> *u8 called by 1: main |
| 60 | func main() -> i64 |