code wiki / _hdl_build / nx_eco_graph_arch.nx
nx_eco_graph_arch.nx
buildroot/runtime/_hdl_build/nx_eco_graph_arch.nx
about
nx_eco_graph_arch.nx -- SOVEREIGN ARCHITECTURE REVIEW of the ecosystem's dependency design, computed
from the eco_graph store with the field's own instruments (operator 2026-07-16: "is syscalls supposed
to have this design? give the ecosystem design a SOTA review"):
1. SCCs (iterative Kosaraju) -> cycles = Acyclic-Dependencies-Principle violations, NAMED; the
largest SCC = the "core" in MacCormack's core-periphery method
2. PROPAGATION COST -> avg % of the codebase a change can reach (MacCormack et al.,
"Exploring the Structure of Complex Software Designs" -- Linux/
Mozilla were measured with exactly this)
3. Fan-in concentration -> the god-node question: direct-import share of the top hubs
(libc-pattern universal base vs unhealthy coupling)
4. Depth histogram -> generations from roots: deep layered composition vs base-hugging flat
Usage: nx_eco_graph_arch <store-prefix> license_tier: ORIGINAL expect_exit:0
dependencies 2 imports · 0 importers
imports: nx_syscalls.nxnx_eco_graph.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
| 15 | const K_MAGIC_10000: i64 = 10000 |
functions
| 17 | func aw(s: *u8) -> i64 { var n:i64=0; while s[n]!=(0 as u8){n=n+1} sys_write(1,s,n); return 0 } |
| 18 | func an(v: i64) -> i64 { let b:*u8=sys_mmap(24); var m:i64=v; if m<0{sys_write(1,"-" as *u8,1);m=0-m} let t:*u8=sys_mmap(24); var k:i64=0; if m==0{t[0]=48 as u8;k=1} while m>0{t[k]=(48+(m%10)) as u8;m=m/10;k=k+1} var j:i64=0; while j<k{b[j]=t[k-1-j];j=j+1} sys_write(1,b,k); return 0 } |
| 19 | func aname(g: *EcoGraph, idx: i64) -> i64 |
| 27 | func main(argc: i64, argv: *i64) -> i64 |