nx_revimg_discover_gate.nx
buildroot/runtime/nx_revimg_discover_gate.nx
about
nx_revimg_discover_gate.nx -- referee for the reverse-image cross-site discovery engine.
Synthetic multi-site corpus (perceptual fingerprints with planted relationships -- no decode needed):
site0 A (official): F1,F2 = the entity's seed media; F3,F4 = A's OTHER media.
site1 B (fan repost): F1^3bits = a RECOMPRESSED copy of F1 (Hamming 3); F5 = B's other media; N1 = noise.
site2 C (unrelated): U1,U2 -- nothing of the entity.
site3 D: F5^3bits = a copy of F5 (reachable ONLY after F5 is harvested) ; F6.
seeds R1 = {F1,F2}. copy_thresh = 6.
row1 CROSS-SITE MATCH -- seed F1 is found on BOTH site0 (exact) and site1 (recompressed) = "what other
sites have the media", robust to recompression a sha256 content-hash would miss.
row2 HOST RANKING -- site A (hosts 2 seeds) outranks site B (1); unrelated C is never a host.
row3 HARVEST -- site A's other media {F3,F4} and site B's {F5,N1} are harvested as NEW results.
row4 GROW -- folding the harvest into the seeds discovers site D (via F5's copy): the host
set grows 2 -> 3. The search results grew.
row5 PRECISION -- unrelated site C is NEVER a host, before or after growth (no false growth).
GREEN iff 5/5. Durable verdict -> knowledge/status/revimg_discover_gate.log. license_tier: ORIGINAL
dependencies 1 imports · 0 importers
imports: nx_revimg_discover.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 g_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 |
| 19 | func g_num(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 |
| 20 | func g_w(fd: i64, s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(fd,s,n); return 0 } called by 1: main |
| 21 | func g_wn(fd: i64, 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 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(fd,bb,k); return 0 } called by 1: main |
| 23 | func g_has_site(arr: *i64, n: i64, sid: i64) -> i64 { var i: i64=0; while i<n { if arr[i]==sid { return 1 } i=i+1 } return 0 } called by 1: main |
| 24 | func g_hits_of(sites: *i64, hits: *i64, n: i64, sid: i64) -> i64 { var i: i64=0; while i<n { if sites[i]==sid { return hits[i] } i=i+1 } return 0-1 } called by 1: main |
| 25 | func g_arr_has(arr: *i64, n: i64, val: i64) -> i64 { var i: i64=0; while i<n { if arr[i]==val { return 1 } i=i+1 } return 0 } called by 1: main |
| 27 | func main() -> i64 |