code wiki / _hdl_build / nx_ciq_census.nx
nx_ciq_census.nx
buildroot/runtime/_hdl_build/nx_ciq_census.nx
about
nx_ciq_census.nx -- R0 GENESIS GATE of the NISHI COMPETITIVE-INTELLIGENCE QUADRANT arc (CIQ):
the sovereign team that produces an S-class, MEASURED, four-quadrant (Gartner Magic Quadrant +
HBR/BCG growth-share) competition + features analysis -- researcher fetches cited data, census-taker
grades Nishi-vs-incumbent feature-by-feature, analyst scores the two MQ axes, quadrant-placer places
every entity + computes the where-we-are -> where-we-need-to-go gap vector, visualizer renders it
no-float, publisher ships feedback+docs+visuals. This R0 is the HONEST maturity scorecard of THAT
team: one row per (role x capability), graded ABSENT->PRESENT->PARITY->EXCEEDS from EVIDENCE. The
gate LIAR-KILLS any PARITY/EXCEEDS row lacking a measured gate (has_ev=1) -- so "we beat Gartner"
cannot be claimed without proof, BY CONSTRUCTION. Negative control proves the liar-kill fires.
Honest 2026-06-20: the data-gathering rungs (researcher, census-taker) + publish/image substrate are
PRESENT and gate-backed; the analyst/quadrant/visualizer that actually EMIT the four-quadrant
analysis are ABSENT -- that is exactly what this arc builds. ZERO PARITY/EXCEEDS yet: we have not
measured ourselves against Gartner/BCG, and we say so -- that EXCEED is earned in later rungs.
Mirrors nx_connect_census.nx (proven R0 idiom). 100% sovereign. license_tier: ORIGINAL expect_exit: 0
dependencies 1 imports · 0 importers
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
structs
| none |
consts
| 17 | const G_ABSENT: i64 = 0 |
| 18 | const G_PRESENT: i64 = 1 |
| 19 | const G_PARITY: i64 = 2 |
| 20 | const G_EXCEEDS: i64 = 3 |
functions
| 22 | 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 } |
| 23 | 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 grade_name(g: i64) -> i64 |
| 34 | func cap_valid(grade: i64, has_ev: i64) -> i64 |
| 39 | func row(role: *u8, cap: *u8, grade: i64, base: *u8, evidence: *u8, has_ev: i64, tot: *i64) -> i64 |
| 49 | func main() -> i64 |