code wiki / _hdl_build / nx_connect_lds_reconnect.nx
nx_connect_lds_reconnect.nx
buildroot/runtime/_hdl_build/nx_connect_lds_reconnect.nx
about
nx_connect_lds_reconnect.nx -- CONNECT / LDS-community vertical: MEMBER <-> MISSIONARY RECONNECTION.
The signature capability of the LDS beachhead: help members reconnect with the missionaries who
taught them, and returned missionaries catch up with the members/families they served -- a real,
cherished LDS relationship no incumbent (Meetup/Tandem/Match/Mutual/Facebook groups) models.
2026-07-23 LIBRARY SPLIT (the DRY note below is now DISCHARGED): the model itself moved to
nx_connect_lds_reconnect_lib.nx so THIS gate and the LIVE app (nx_connect_serve, which surfaces
reconnection at /connect/reconnect) bind ONE implementation of the law and cannot drift apart.
This file is now purely the VERIFIER: the synthetic corpus + the 8 checks. Its emitted output is
byte-identical to the pre-split version, which is the proof that the extraction changed no behavior.
THE MODEL (see the library for the full statement): a person carries {mission, areas bitmask, time
window}. Two people could have KNOWN each other only if SAME MISSION and shared AREA and time
OVERLAP -- all three NECESSARY. Discovery is consent-gated both ways (Art.9-style). The DATE lane is
unreachable when a minor is involved, in both directions.
8 checks incl. 3 negative controls. 100% sovereign. license_tier: ORIGINAL expect_exit: 0
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_connect_lds_reconnect_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
| 21 | 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 } |
| 22 | 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 } |
| 25 | func rec(band: i64, mission: i64, areas: i64, s: i64, e: i64, optin: i64, token: i64, conf: i64) -> *i64 |
| 31 | func tcheck(pass: i64, label: *u8, fails: *i64) -> i64 |
| 37 | func main() -> i64 |