code wiki / _hdl_build / nx_vizsla_graph.nx

nx_vizsla_graph.nx

buildroot/runtime/_hdl_build/nx_vizsla_graph.nx

14027 B357 linesdepth 6pulls 7 transitivereach 0 importersview sourcekind tooltopic vizsla

docs dependencies structs consts functions

about

nx_vizsla_graph.nx -- NISHI VIZSLA: INTRO-GRAPH / WHO-KNOWS-WHOM (PRM/CRM depth, the marquee feature Clay / Affinity sell as "warm intro paths"). Operator 2026-06-23: real-system depth. Models the relationship NETWORK as undirected edges between people ("a knows b") on the sovereign seg_store plane (additive "edge:" CID records) and answers the killer question: to reach someone you don't know directly, WHO in your network can introduce you? = BFS shortest path. Computed locally; the social graph never leaves the machine (no cloud graph-mining / no contact-scraping for ad targeting -- the privacy exceed). link <prefix> <a> <b> <date> record an undirected edge a--b (additive, idempotent) neighbors <prefix> <id> everyone directly connected to <id> path <prefix> <from> <to> shortest intro path from <from> to <to>; the intermediates = introducers Integer-only, deterministic. license_tier: ORIGINAL

dependencies 3 imports · 0 importers

imports: nx_syscalls.nxnx_canon_cid.nxnx_seg_store.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

14	const K_MAGIC_1970: i64 = 1970
15	const K_MAGIC_4096: i64 = 4096
16	const K_MAGIC_2048: i64 = 2048
17	const K_MAGIC_1024: i64 = 1024
18	const K_MAGIC_65536: i64 = 65536

functions

20	func vx_slen(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n } called by 4: vx_p vx_dup vx_kmemeq vx_iskind
21	func vx_p(s: *u8) -> i64 { sys_write(1, s, vx_slen(s)); return 0 } called by 4: vx_cmd_link vx_cmd_neighbors vx_cmd_path main calls 2: sys_write vx_slen
23	func vx_eq(a: u8, b: u8) -> i64 called by 4: vx_intern vx_cmd_link vx_cmd_neighbors main
30	func vx_dup(s: u8) -> u8 called by 2: vx_collect_edges vx_intern calls 2: vx_slen sys_mmap
39	func vx_lex_gt(a: u8, b: u8) -> i64 called by 1: vx_cmd_link
52	func vx_cat(dst: u8, off: i64, s: u8) -> i64 called by 4: vx_collect_edges vx_cmd_link vx_cmd_neighbors vx_cmd_path
58	func vx_catn(dst: *u8, off: i64, v: i64) -> i64 called by 3: vx_cmd_link vx_cmd_neighbors vx_cmd_path calls 1: sys_mmap
71	func vx_kmemeq(b: u8, off: i64, n: i64, s: u8) -> i64 called by 2: vx_iskind vx_field calls 1: vx_slen
78	func vx_iskind(b: u8, koff: i64, kl: i64, pfx: u8) -> i64 called by 1: vx_collect_edges calls 2: vx_slen vx_kmemeq
84	func vx_field(rec: u8, rl: i64, want: u8, out: *u8, cap: i64) -> i64 called by 1: vx_collect_edges calls 2: ss_r32 vx_kmemeq
108	func vx_datedays(s: *u8) -> i64 called by 1: vx_cmd_link calls 1: sys_mmap
137	func vx_collect_edges(prefix: u8, ef: i64, et: *i64) -> i64 called by 2: vx_cmd_neighbors vx_cmd_path calls 8: sys_mmap ss_manifest vx_cat ss_readall ss_r32 vx_iskind+2
175	func vx_intern(nid: i64, nnp: i64, s: *u8) -> i64 called by 1: vx_cmd_path calls 2: vx_eq vx_dup
183	func vx_cmd_link(argc: i64, argv: *i64) -> i64 called by 1: main calls 15: vx_p vx_datedays vx_eq vx_lex_gt sys_mmap canon_encode+9
235	func vx_cmd_neighbors(argc: i64, argv: *i64) -> i64 called by 1: main calls 7: vx_p sys_mmap vx_collect_edges vx_cat vx_eq vx_catn+1
268	func vx_cmd_path(argc: i64, argv: *i64) -> i64 called by 1: main calls 7: vx_p sys_mmap vx_collect_edges vx_intern vx_cat sys_write+1
349	func main(argc: i64, argv: *i64) -> i64 calls 5: vx_p vx_eq vx_cmd_link vx_cmd_neighbors vx_cmd_path