code wiki / _hdl_build / nx_evolution_ladder.nx

nx_evolution_ladder.nx

buildroot/runtime/_hdl_build/nx_evolution_ladder.nx

12240 B269 linesdepth 2pulls 2 transitivereach 3 importersview sourcekind tool

docs dependencies structs consts functions

about

nx_evolution_ladder.nx -- THE GRACEFUL EVOLUTION LADDER organ. module: nishi-core.doctrine.evolution_ladder capability: CORE_COMPUTE (the honest "where we are" on the god->canopy technology tree) Charter: knowledge/specs/2026-06-16-graceful-evolution-charter.md. Reads knowledge/registry/evolution_ladder.tsv (one row per tree-layer) and, FRESH every run: * VERIFIES each layer's evidence_src file actually exists (does not trust a declared grade); * COMPUTES the verified maturity rung (ABSENT..PHYSICS-OPTIMUM) from (evidence_kind, file-exists); * THE LIAR-KILL: a layer claiming measured/exceed/physics whose evidence file does NOT exist is counted `unproven` -> VERDICT RED. No "S-class exceeds" claim survives without its artifact. * tree-whole: every layer reaches the HW root (no broken parents), and carries a purpose; * NEVER-BRICK (Rule 26, inherited from genesis): a layer doing persistent hardware writes but not proven (safety=brickable) is counted `unsafe` -> RED. Sovereign: imports only nx_syscalls (no gcc/sed/awk). license_tier: ORIGINAL

dependencies 1 imports · 3 importers

imports: nx_syscalls.nx

imported by: nx_evolution_ladder_gate.nxnx_wiki_ai_start_page.nxnx_wiki_charter_page.nx

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

structs

none

consts

19	const EL_FILE: *u8 = "knowledge/registry/evolution_ladder.tsv"
22	const RK_ABSENT: i64 = 0
23	const RK_SPEC: i64 = 1
24	const RK_BUILT: i64 = 2
25	const RK_GATED: i64 = 3
26	const RK_MEASURED: i64 = 4
27	const RK_EXCEEDS: i64 = 5
28	const RK_PHYSICS: i64 = 6

functions

40	func el_puts(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 2: el_print_ladder main calls 1: sys_write
41	func el_putn(v: i64) -> i64 called by 1: main calls 2: sys_write sys_mmap
51	func el_streq(a: u8, b: u8) -> i64 called by 4: el_kind_code el_exists el_find el_analyze
59	func el_field_dup(b: u8, ls: i64, le: i64, f: i64) -> u8 called by 1: el_parse calls 1: sys_mmap
77	func el_kind_code(s: *u8) -> i64 called by 1: el_parse calls 1: el_streq
86	func el_rung_name(r: i64) -> *u8 called by 4: el_print_ladder main main main
98	func el_exists(path: *u8) -> i64 called by 2: el_verified_rung el_analyze calls 3: el_streq sys_mmap sys_read_file
107	func el_parse(file: *u8) -> i64 called by 1: el_analyze calls 4: sys_mmap sys_read_file el_field_dup el_kind_code
154	func el_find(id: *u8) -> i64 called by 1: el_analyze calls 1: el_streq
163	func el_count() -> i64 { return EL_N } called by 2: main main
164	func el_id(i: i64) -> u8 { let ids: i64 = EL_IDS as i64; return ids[i] as u8 } called by 2: main main
165	func el_label(i: i64) -> u8 { let labels: i64 = EL_LABELS as i64; return labels[i] as u8 } called by 2: main main
168	func el_verified_rung(idx: i64) -> i64 called by 3: el_print_ladder main main calls 1: el_exists
179	func el_analyze(file: u8, outs: i64) -> i64 called by 4: main main main main calls 5: el_parse sys_mmap el_streq el_find el_exists
224	func el_print_ladder() -> i64 called by 1: main calls 3: el_puts el_verified_rung el_rung_name
238	func main() -> i64 calls 7: el_puts sys_mmap el_analyze sys_exit el_print_ladder el_putn+1