nx_vizsla_census.nx
buildroot/runtime/nx_vizsla_census.nx
about
nx_vizsla_census.nx -- the MEASURED scoreboard for NISHI VIZSLA, the family personal assistant (operator
2026-06-22: "keep going on our hardware rung up nishi vizsla to get our personal assistant capabilities for
running our personal relationship management and calendar and to dos and all the other things s class exceed").
Grades the LIVE assistant surface across 28 axes, NEVER self-scored: each cell is PROVEN by reading the REAL
shipped organ source on disk -- an EXCEEDS/PRESENT cell requires the implementing symbol to EXIST; an ABSENT
cell (the worklist) requires it to NOT exist anywhere = an honest gap. Liar-killed BOTH directions. Anchored
to the sovereign-fetched corpus knowledge/fetched/pa_*.raw (the researcher's personal-assistant domain).
Self-contained (only nx_syscalls). The incumbents (Google Calendar / Todoist / Notion / Outlook / Monica /
Clay / Motion / Reclaim) are the yardsticks: Vizsla EXCEEDS on the differentiated axes (obligation ledger,
timed notes, archetype gap, unified maintenance, money-history time-travel, recruiter channel, sovereignty)
and is ABSENT on the whole CALENDAR area + advanced task features + the push boundary = the named next rungs.
PRM axes ............ PA1..PA4 TASKS/PROJECTS axes . PA5..PA9
CALENDAR axes ....... PA10..PA14 FINANCE axes ........ PA15..PA16
PROACTIVE/SOVEREIGN . PA17..PA19 CAREER axes ......... PA20..PA21
PRM DEPTH axes ...... PA22..PA28 (health/contact+search/typed-interactions+timeline/analytics/segments/dedup-merge/intro-graph)
SNAPSHOT ORACLE: exceeds==7, present==16, absent==5 (of 28). The PRM DEPTH ladder PA22-28 LANDED 2026-06-23
(7 gated+blessed organs) -> present 9->16; PA9 NL-capture also now present (capture organ landed). A rung
re-grades its axis (living map); the liar-kill asserts exceeds==7 + absent==5 + all 22 evidence symbols proven.
expect_exit: 0 license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_itoa_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
| 22 | const K_MAGIC_262144: i64 = 262144 |
functions
| 24 | func lc_w(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } sys_write(1, s, n); return 0 } |
| 29 | func lc_n(v: i64) -> i64 { nxi_out(v); return 0 } |
| 30 | func lc_read(path: *u8, buf: *u8, cap: i64) -> i64 |
| 36 | func lc_exists(path: *u8) -> i64 { let fd: i64 = sys_openat_rd(path); if fd < 0 { return 0 } sys_close(fd); return 1 } |
| 37 | func lc_has(buf: *u8, n: i64, needle: *u8) -> i64 called by 1: lc_file_has |
| 44 | func lc_file_has(path: *u8, needle: *u8, buf: *u8, cap: i64) -> i64 |
| 48 | func lc_cell(cls: *u8, id: *u8, txt: *u8) -> i64 { lc_w(" ["); lc_w(cls); lc_w("] "); lc_w(id); lc_w(" "); lc_w(txt); lc_w("\n"); return 0 } |
| 50 | func main() -> i64 |