code wiki / _hdl_build / nx_vizsla_graph_gate.nx
nx_vizsla_graph_gate.nx
buildroot/runtime/_hdl_build/nx_vizsla_graph_gate.nx
about
nx_vizsla_graph_gate.nx -- VIZSLA intro-graph gate. Construction-known oracle.
Graph (undirected): me--alice alice--bob bob--carol me--dave dave--carol
me->carol: me>dave>carol (len 2) BEATS me>alice>bob>carol (len 3) => BFS shortest = via dave
alice->carol: alice>bob>carol (len 2)
me->eve: eve not in graph => no path
link a b and link b a = the SAME canonical edge (undirected dedup)
Rows:
1 link link me alice -> new=1
2 undirected-dedup link alice me (reversed) -> new=0 (same canonical edge)
3 neighbors neighbors me -> count=2, alice + dave present
4 shortest-path path me carol -> length=2 via=dave path=me>dave>carol (3-hop NOT taken)
5 symmetric path carol me -> length=2 (undirected)
6 multi-hop path alice carol -> length=2 via=bob path=alice>bob>carol
7 no-path path me eve -> length=-1 via=NONE path=NONE
8 self-path path me me -> length=0
9 neg-self-loop link bob bob -> fail loud exit 1
Evidence: VIZSLA-GRAPH-GATE -> stdout + knowledge/status/vizsla_gate.log; exit 0 iff 9/9.
license_tier: ORIGINAL
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_gate_verdict.nx
imported by: nobody (leaf or entry point)
structs
| none |
consts
| none |
functions
| 22 | func og_slen(s: *u8) -> i64 { var n: i64 = 0; while s[n] != (0 as u8) { n = n + 1 } return n } |
| 23 | func og_p(s: *u8) -> i64 { sys_write(1, s, og_slen(s)); return 0 } |
| 25 | func og_cat(dst: *u8, off: i64, s: *u8) -> i64 |
| 31 | func og_catn(dst: *u8, off: i64, v: i64) -> i64 |
| 44 | func og_readall(path: *u8, szout: *i64) -> *u8 |
| 58 | func og_runv(elf: *u8, args: *i64, outpath: *u8) -> i64 |
| 83 | func og_idx(buf: *u8, sz: i64, needle: *u8) -> i64 |
| 97 | func og_has(path: *u8, needle: *u8) -> i64 |
| 104 | func og_row(name: *u8, pass: i64) -> i64 |
| 110 | func og_args(a1: *u8, a2: *u8, a3: *u8, a4: *u8, a5: *u8, a6: *u8) -> *i64 |
| 116 | func main(argc: i64, argv: *i64) -> i64 |