code wiki / _hdl_build / nx_connect_match.nx
nx_connect_match.nx
buildroot/runtime/_hdl_build/nx_connect_match.nx
about
nx_connect_match.nx -- R1 of CONNECT: the RECIPROCAL language-exchange MATCH ENGINE + its gate.
The language-exchange wedge is COMPLEMENTARY, not similarity: a good partner TEACHES what you
want to LEARN *and* LEARNS what you can TEACH. So the core signal is a HARMONIC MEAN of the two
directional fits -- one-sided pairs collapse to 0 (you cannot reciprocally exchange). Interests
modulate; reciprocity is NECESSARY. Pure INTEGER math (no floats). The output is an INTERNAL
ranking weight 0..100 -- NEVER a user-facing "compatibility score" (PNAS 2020: profile traits
~5% of long-term variance; we surface reciprocal interest, conversation decides).
SAFETY BY CONSTRUCTION (launch prerequisite, proven here in the gate): romance/dating lane edges
are UNREACHABLE to/from minors -- a minor who is a PERFECT reciprocal+interest match is still
EXCLUDED from a dating-lane query (both directions), while remaining free to language-exchange.
Gate has 7 checks incl. a measured NEGATIVE CONTROL: the naive arithmetic mean would wrongly
surface a one-sided pair (score 25), proving the harmonic mean is what enforces reciprocity.
Mirrors the nx_*_census/gate idiom. 100% sovereign. license_tier: ORIGINAL expect_exit: 0
2026-07-23 LIBRARY SPLIT: the engine moved to nx_connect_match_lib.nx so THIS gate and the LIVE app
(nx_connect_serve /partners) bind ONE implementation. Before the split the live page printed hardcoded
scores while crediting "the gated match engine" -- it asserted a computation it never ran. This file is
now purely the VERIFIER; its emitted output is byte-identical to the pre-split version, which is the
proof that the extraction changed no behavior.
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_connect_match_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 sw(s: *u8) -> i64 { var n: i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 25 | 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 } |
| 27 | func tcheck(pass: i64, label: *u8, fails: *i64) -> i64 |
| 33 | func main() -> i64 |