code wiki / (root) / nx_swarm_maturity.nx

nx_swarm_maturity.nx

buildroot/runtime/nx_swarm_maturity.nx

15364 B321 linesdepth 4pulls 4 transitivereach 0 importersview sourcekind tooltopic swarm

docs dependencies structs consts functions

about

nx_swarm_maturity.nx -- SWARM FABRIC MATURITY census (SF-MAT): the HONEST measurement the operator demanded -- "maturity is the real feedback", NOT feature-presence (944/1000 was inflatable: 'do we have a form of X'). This grades every capability on a PRODUCTION-MATURITY ladder, EVIDENCE-CAPPED so it cannot overclaim: L0 not-built · L1 GATED (liar-killed synthetic/single-machine) · L2 LIVE (real data/telemetry) · L3 MCP (operationally callable) · L4 MULTI-NODE (live across >=2 real remote participants) · L5 MATURE (hardened + externally PERF-benchmarked vs the actual tool, not feature-presence). ★★THE ANTI-OVERCLAIM LIAR-KILLER (mechanical): L1 requires the gate symbol to VERIFY ON DISK (a claimed gate that isn't in the organ file -> L0, never fabricated). L4 requires knowledge/compare/swarm_multinode .proof; L5 requires swarm_hardened.proof + swarm_extbench.proof. Those files do NOT exist -> EVERY capability is mechanically CAPPED at L3. So the maturity score reflects what's PROVEN, not claimed; it RATCHETS up only when a real multi-node/hardened/benchmark proof is produced (create the proof file). Reads knowledge/compare/swarm.maturity (label|organ|gate|mcp|live). Score = sum(level)/(n*5) permille. nx_swarm_maturity [maturity-file] -- grade + honest score + the maturity roadmap + self-liar-kills license_tier: ORIGINAL expect_exit:0

dependencies 1 imports · 0 importers

imports: nx_swarm_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

19	const MT_MAGIC_262144: i64 = 262144
20	const MT_MAGIC_65536: i64 = 65536
22	const MT_ROOT: *u8 = "knowledge/compare/"

functions

24	func mt_puts(s: *u8) -> i64 { sys_write(1, s, fa_len(s)); return 0 } called by 3: mt_grade_dims mt_bar main calls 1: fa_len
25	func mt_putn(v: i64) -> i64 called by 2: mt_bar main
40	func mt_file_has(path: u8, needle: u8) -> i64 called by 3: mt_grade_dims mt_auto_matrix main calls 2: sb_read sb_has
46	func mt_exists(path: *u8) -> i64 called by 1: main
54	func mt_field(line: u8, ln: i64, idx: i64, out: u8) -> i64 called by 3: mt_grade_dims mt_auto_matrix main
69	func mt_streq(a: u8, b: u8) -> i64 called by 3: mt_grade_dims mt_auto_matrix main
75	func mt_starts(s: u8, pfx: u8) -> i64 called by 1: mt_grade_dims
82	func mt_grade_dims(dimp: u8, rowsb: i64, secminb: *i64) -> i64 called by 1: main calls 9: sb_read mt_field fa_len sb_pint mt_streq mt_file_has+3
129	func mt_grade(gate_ok: i64, live: i64, mcp: i64, mn_proof: i64, hard_proof: i64, ext_proof: i64) -> i64 called by 1: main
139	func mt_bar(L: i64) -> i64 called by 2: mt_grade_dims main calls 2: mt_puts mt_putn
151	func mt_auto_matrix(matrixp: u8, rowsb: i64, l1b: i64, l0b: i64) -> i64 called by 1: main calls 5: sb_read mt_field fa_len mt_streq mt_file_has
185	func main(argc: i64, argv: *i64) -> i64 calls 14: fa_cat mt_exists mt_puts mt_auto_matrix mt_putn sb_read+8