code wiki / _hdl_build / nx_connect_census.nx

nx_connect_census.nx

buildroot/runtime/_hdl_build/nx_connect_census.nx

10751 B127 linesdepth 2pulls 2 transitivereach 0 importersview sourcekind tooltopic connect
docsdependenciesstructsconstsfunctions

about

nx_connect_census.nx -- R0 GENESIS GATE of CONNECT (sovereign worldwide social + language app). The honest, data-driven MATURITY SCORECARD: one row per (pillar x capability), graded ABSENT->PRESENT->PARITY->EXCEEDS from EVIDENCE. The gate LIAR-KILLS any PARITY/EXCEEDS row lacking measured evidence (has_ev set only when a real gate / head-to-head backs it), so no "beats Tandem/Meta/Match" can be claimed without proof -- BY CONSTRUCTION. Negative control proves the liar-kill fires. Grades are HONEST 2026-06-20: CONNECT is a brand-new kickoff, so EVERY cell starts ABSENT -- we have built nothing yet, and we say so. Each cell carries its cited incumbent baseline (the yardstick a later rung must reach PARITY/EXCEEDS against). Cells seeded by the verified deep-research synthesis (run wf_38c21b4e, 17 agents, adversarially verified). Later rungs EARN a grade by attaching a measured gate (set has_ev=1 + name the gate). Mirrors nx_ge_census.nx (proven R0 idiom). 100% sovereign. license_tier: ORIGINAL expect_exit: 0

dependencies 1 imports · 0 importers

nx_syscalls.nx nx_connect_census.nx

imports: nx_syscalls.nx

imported by: nobody (leaf or entry point)

call flow from main pre-order; caps 40 nodes / depth 6 declared; ↻ = already shown

main sys_mmap sw sys_write row sw ↻ grade_name sw ↻ cap_valid sn sys_mmap ↻ sys_write ↻ cap_valid ↻ sys_exit

structs

none

consts

14const G_ABSENT: i64 = 0
15const G_PRESENT: i64 = 1
16const G_PARITY: i64 = 2
17const G_EXCEEDS: i64 = 3

functions

19func sw(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 3: grade_namerowmain calls 1: sys_write
20func 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 }
called by 1: main calls 2: sys_mmapsys_write
22func grade_name(g: i64) -> i64
called by 1: row calls 1: sw
31func cap_valid(grade: i64, has_ev: i64) -> i64
called by 2: rowmain
36func row(pillar: *u8, cap: *u8, grade: i64, base: *u8, evidence: *u8, has_ev: i64, tot: *i64) -> i64
called by 1: main calls 3: swgrade_namecap_valid
46func main() -> i64
calls 6: sys_mmapswrowsncap_validsys_exit