code wiki / _hdl_build / nx_connect_graph.nx
nx_connect_graph.nx
buildroot/runtime/_hdl_build/nx_connect_graph.nx
about
nx_connect_graph.nx -- R4 of CONNECT: the UNIFIED heterogeneous interest graph (HIN) + one
meta-path matching model. The core product promise: incumbents SILO language / hobby / faith /
dating as separate products or flat filters; we put person + language + hobby + faith + place on
ONE graph and match across all of them with ONE model, parameterized by the relationship LANE.
A person is a node; attributes are typed edges (teach/learn-language, likes-hobby, faith, place).
Meta-path connection strengths (integer, no floats): reciprocal-language (the R1 path), shared-
hobby, shared-faith, co-location. gx_graph_score(A,B,lane) combines them with LANE-appropriate
weights -- so the SAME model serves language-exchange, friendship, community and dating.
Proven here: (1) it GENERALIZES R1 -- the language lane still requires reciprocal language;
(2) it UNIFIES across silos -- a pair with NO shared language but strong shared hobby+faith is
found for the friendship lane, where a language-only matcher returns nothing; (3) faith is
CONSENT-GATED (contributes only if BOTH opted into faith discovery -- GDPR Art.9 by construction);
(4) the minor<->romance safety wall is preserved. 7 checks incl. negative controls.
(DRY note: the small match primitives are re-stated here to keep the gate self-contained;
production extracts them into a shared library organ.) 100% sovereign.
license_tier: ORIGINAL expect_exit: 0
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_connect_graph_lib.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
| 24 | func mkp(band: i64, teach: i64, learn: i64, hob: i64, faith: i64, optin: i64, place: i64) -> *i64 |
| 30 | func sw(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 31 | func sn(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 } |
| 34 | func tcheck(pass: i64, label: *u8, fails: *i64) -> i64 |
| 40 | func main() -> i64 |