Nishi Family › Compare › Sovereign Toolchain & Build Performance

Nishi Compare · capabilities, evidence and delivery

Sovereign Toolchain & Build Performance

Compare capabilities and delivery evidence. Source discovery, qualification, deployment and accepted outcomes are separate; an open contract names work still to verify.

Nishi nx_cc_sovereign -> nxasm_x86 (bits-up, no gcc/llvm) vs industry compile SOTA -- measured 80-90ms/gate, whole-program, no cache

Overview

The purpose, declared position and evidence coverage of this domain. Source presence and completed acceptance are different measures.

2026-09-08 cache qualification: NAS tested; runner promotion pending. Existing runner removes duplicate cache-key computation and payload reads for cache-size accounting. Candidate e7c68f4e9913357ac016d0b7134b17fba33cecb034ee431a36c58d62d382965d passed61/61 native NAS isolated cache checks in job1788883537 using real host admission policy. No SOTA speedup or served runner change claimed. Gate preserves canonical input evidence and stops dependent checks on prerequisite refusal. Dependencies: deploy, loadgov, referee.

Where we are. Measured 2026-08-17 on the LOCAL sovereign toolchain (WSL, no NAS load): nx_cc_sovereign compiles a 275-line gate to 15,198 asm lines in 71ms, nxasm assembles it in 9ms -- 80ms end to end. UPDATED 2026-08-23: dead-code elimination LANDED 2026-08-18 (B1, opt_module_dce_mark), and on the LIVE promoted toolchain a trivial main importing nx_syscalls now emits 976 asm lines / 10 functions / a 7,126 B binary instead of the whole 4,311-line syscall closure (measured via /api/build himport, nx_cc_sovereign 0288e2ea). So the compiler is FAST and the REMAINING cost is STRUCTURAL: whole-program compilation, no separate compilation, no content-addressed build cache => an unchanged closure is still re-COMPILED on every build even though it is no longer re-EMITTED. On the NAS this is amplified by box contention, per-request /api/build orchestration, and bursting parallel builds (a 35-build burst drove load to 20 with edge 503s). The genuine EXCEEDs are deterministic content-hashed reproducible builds and never-brick-the-builder guards. Counts below are measured at emit. ADDED 2026-08-21: the roadmap layer of this domain was INVISIBLE TO THE RANKER until today -- see the grammar note above -- so nothing here had ever been prioritised against the rest of the fleet.

Where we need to go. Builds and compiles must not be a bottleneck: reach industry build-engineering SOTA (Go sub-second builds, Rust/Zig recompile-only-changed, ccache/Bazel content caches) WITHOUT surrendering the two sovereign EXCEEDs -- deterministic bit-exact reproducibility and a bits-up no-gcc/llvm stack. Every rung is gated by an equivalence proof (rebuild the estate, byte/behaviour-identical) because the compiler is load-bearing: a codegen regression miscompiles everything.

The unit. 1 u = one measured session-leg. Toolchain rungs are compiler-surgery class, so estimates carry more risk than organ rungs; each republishes actual-vs-estimate when it lands.

Cost to kill the redundancy: 2 u remaining of 4. B1 dead-code elimination LANDED 2026-08-18 (redundant EMISSION gone: a trivial main is 976 asm lines, not 4,311); B2 content-addressed cache is the remaining safest win -- it needs no separate-compilation rewrite and makes identical rebuilds free.

Cost to industry build-speed parity: 9 u. adds B3 separate compilation / precompiled closure + B4 parallel scheduler; B5 remote cache is beyond parity.

Research bar. Zig incremental compiler (2026) is measured on self-hosted, in-place incremental recompilation -- recompiles only the changed function, sub-100ms edit-build loops. Theirs: the 2026 self-hosted-compiler speed frontier. Ours: B3+B4 reach it while keeping our determinism, which Zig does not guarantee bit-exact [zig-incremental].

Research bar. Bazel / ccache content-addressed cache is measured on build actions keyed by content hash, never re-run an identical action, shared across a fleet. Theirs: the never-rebuild-the-same-thing-twice bar. Ours: B2 is the local form (closure_sha256 already computed); B5 is the remote form [bazel-remote-cache].

Latest recorded release

2026-09-15 · B6

nx_cc_equiv_gate.nx (both laptop trees, sha e436f84f): baseline as DATA from knowledge/cc_equiv_baseline.conf with baseline_src and byte sizes printed, BASELINE-IS-CHALLENGER and BASELINE-CONF-UNREADABLE refusals, LOG-UNWRITABLE refusal after an idempotent mkdir of knowledge/status, per-row product unlink so ea/eb never report the previous row, FAIL classes named (baseline-cannot-build, neither-side-builds, challenger-cannot-build, behaviour-differs-or-vacuous), baseline_cannot_build= in the summary before verdict=. nx_bless_compiler.nx (sha b34e29bd): verdict reader takes the log path and the bless epoch and refuses a line older than the bless, log path and challenger stage derived once from the located root, source-built gate fallback that PASSES the challenger, _build/nx_game_gate.sov.elf probe. Laptop: bless NEUTRAL read game gate 0 vs 0 fails, equiv last_epoch equal to bless_t0, BLESSED+VERIFIED; live _offc/nx_cc_sovereign.elf 880434 B sha 2c039ca0 (.bak 867366 B sha 1d3d647d, also banked as nx_cc_sovereign.elf.bank-pre-sizeof-0915-1d3d647d); gen3 rebuild byte-identical; nx_content_get_client and nx_content_put_client now build through nx_sov_build_run with 0 errors. NAS sources NOT yet landed.

Release history and work log

Release entries describe recorded changes; they do not establish that every capability passed evaluation.

11 of 15 capability source symbols found|3 of them authored stronger-claims|4 open|coverage 733/1000|adoption 10 full / 1 partial

Evidence profile — what the gaps on this board actually are

Measured by nx_swcompare_evidence, read back by nx_evprofile_lib. Every figure is a count with its denominator — there is deliberately no score, no grade and no percentage anywhere in this band, because a stored scalar is a field a seat can edit and a counted partition is not.

proven able to fail counts the gates that have a RECORDED RED — nx_gate_bite mutated the gate subject, rebuilt it, watched the gate go red, and that record is inside the shared TTL. never bitten is its complement over the same denominator: those gates ran and were green, and nothing has ever shown them able to detect anything, so their green is a statement about this run and not about the gate. green at 0/0 is a separate and much weaker observation — the gate printed GREEN on a zero denominator, so its own tooth counter says it examined nothing. A gate can be green, non-zero, and still never bitten; that is the common case and it is now visible instead of implied.

partition: grounded + unsupported = 11 vs present 11 · named + unnamed + withheld = 4 vs open 4 · both reconcile

liar-kill conj=GPQN · all four conjuncts held

graded document: BUILDROOT tree, 7647 bytes · gates map: PRIMARY · stamped 4d 7h ago · source ../knowledge/status/evstamp_toolchain.verdict

Gap class	What it is, and the work it names
FLIP-READY	A watch contract symbol is now present in the organ it named: the cell can flip on a pure data edit with no new code. These are the cheapest closures on this board and they belong before any new work.

This band reports the referee counts. The per-axis worklist rows — which axis is unsupported, which watch is ready to flip, which gap is unnamed — are printed by nx_swcompare_evidence toolchain itself and are not carried on the stamp, so this page names the classes and the producer names the rows. That split is stated rather than hidden: a count without a worklist is not actionable, and this band is honest about which half of that it is.

Production map

Follow the dependencies, declared acceptance criteria and recorded priorities. Inspect source binding before treating a rank as executable work.

Ranking source binding: PLAN_MATRIX_BOUND_ONLY. Recorded priorities require current acceptance evidence and resource checks before execution.

Ranking matches the captured plan and matrix only. Latest execution outcome, research freshness, accepted delivery and investment return are unverified.

Recorded priority estimates

Order from nx_compare_rank (nx_dr_ocm: (deficit + cost-of-delay + option + enables) x sponsor x self-sufficiency x momentum / cost). FINISH rows are rungs whose symbol is present but whose organ is short of full adoption: listed before new work by this heuristic. Priority is not measured delivery cost or execution readiness. Stamp: # asof=1790610496 domain=toolchain target_version=1.0 rungs=6 done=3 open=3 finish=1 ranker=nx_dr_ocm

#	Stage	Rung	Priority	Derivation
F	FINISH	Node self-host proof against the hub compiler (baseline-as-data equiv gate + freshness-checked bless) (B6) eq_first_line dossier	GATE:DEPLOYED-DARK trial=RED	deployed, no execution surface runs it: admit it to the gate roster
#1	1.0	Separate compilation / precompiled closure (B3) cc_emit_object dossier	1200	v=24 m=2 c=40
#2	1.0	Cost-aware parallel scheduler (B4) bld_sched_parallel dossier	800	v=12 m=2 c=30
#3	later	Remote / distributed build cache (B5) bld_cache_remote dossier	333	v=5 m=2 c=30

Declared roadmap — contract, acceptance, executor, effort

Rung	Closes with	Definition of done (pre-declared)	Executor	Est.
Dead-code elimination (reachability) (B1)	opt_module_dce_mark	LANDED 2026-08-18 (actual 1 u vs estimate 2): mark-only reachability from main (opt_module_dce_mark in nx_opt.nx, consumed by the opt loop and x86ctx_emit_module_live, --no-dce as the A/B lever). RE-KEYED 2026-08-23 from cc_gc_unreached (never defined anywhere, ABSENT-PROVEN over 23,071 files) to the symbol that shipped, so the board stops ranking a landed rung first. DONE-RULE MEASURED 2026-08-23 on the live toolchain (nx_cc_sovereign 0288e2ea, /api/build himport = import nx_syscalls + a main calling sys_exit): asm 976 lines / 32,488 B / 10 functions (main, sys_exit, the 8-function default-on crash guard) / binary 7,126 B, down from the 4,311-line whole-closure emission. Original done-rule: the equivalence gate stays GREEN (every estate binary rebuilds byte- or behaviour-identical) AND a trivial main's asm drops from 4,311 lines toward its actual reachable set. A DCE that drops a reached function is a miscompile, and a missed edge is a LOUD undefined-label assemble failure, never a wrong binary.	Compiler	2 u
Content-addressed build cache (B2)	bld_cache_cas	Key a cache on (src_sha256 + closure_sha256 + toolchain_sha) -> cached .sov.elf; hit = copy, miss = build + populate. DONE-RULE: an unchanged rebuild returns byte-identical bytes with ZERO compiler invocation (proven by a fork counter) and a one-byte source edit MISSES. The daily ~1000-binary drift census becomes file-copies.	Organ	2 u
Separate compilation / precompiled closure (B3) after B1	cc_emit_object	Compile the shared base closure (syscalls, sha256, bits, gate_verdict) ONCE to a cached object with a symbol table; a target build emits only its own functions and links. DONE-RULE: equiv gate GREEN AND a gate build's compile time drops from ~80ms toward the ~5ms floor, measured. The big architectural rung.	Compiler+linker	4 u
Cost-aware parallel scheduler (B4) after B2	bld_sched_parallel	Replace the BUILD-ADMIT load-serialize with a scheduler that runs the build DAG across cores up to a measured memory/CPU envelope. DONE-RULE: N independent builds complete in ~max(one) not ~sum, no OOM and no edge 503 on a declared batch.	Organ	3 u
Remote / distributed build cache (B5) after B2	bld_cache_remote	The B2 cache shared across hosts, content-addressed and integrity-checked on fetch. DONE-RULE: a second host reuses the first's cached artifact after proving its hash. Beyond parity.	Organ	3 u

Milestones

Milestone	Rungs	Cumulative
T0 · Redundancy killed (DCE + local cache)	B1,B2	4 u
T1 · Industry build-speed parity	B3,B4	9 u
T2 · Fleet-scale caching	B5	12 u

Rung	Closes with	Definition of done (pre-declared)	Executor	Est.
Node self-host proof against the hub compiler (baseline-as-data equiv gate + freshness-checked bless) (B6)	eq_first_line	LANDED 2026-09-15 on the laptop node (actual 1 u): a node builds nx_compile_x86 from the converged source with its live compiler, pulls the HUB's promoted compiler through nx_content_get (whole-file digest verified before a byte is written) and names it on line 1 of knowledge/cc_equiv_baseline.conf; nx_cc_equiv_gate then judges the candidate DIFFERENTIALLY against the hub over all 10 corpus rows plus the self-host stage, printing the bytes of both compilers and refusing a self-comparison or an unresolvable conf by name; nx_bless_compiler installs it with a .bak and a game-gate post-verify, reading a verdict that is FRESH by epoch at the path the anchored gate writes. DONE-RULE: rows=10 passed=10 selfhost=1 baseline_cannot_build=0 verdict=GREEN against the hub baseline, BLESSED+VERIFIED, and the blessed compiler rebuilds itself byte-identical. MEASURED: laptop live compiler 867366 B (Sep 3, no __size_of) to 880434 B sha 2c039ca0; gen3 rebuild byte-identical; nx_swcompare_matrix compile proof went from 20 parse errors to 0.	Organ	1 u

Milestones

Milestone	Rungs	Cumulative
T3 · Swarm node self-host (a node proves its own toolchain against the hub before installing it)	B6	1 u

Ladder verdict. NOT DECLARED. This board names no dated best-in-class or frontier target and no rung roles (sotatarget and rungrole rows on its plan); the ranker labels it NO-LADDER until it does, and until then its rungs climb toward a target nobody has written down. Bars read NO-BAR against the current month 2026-10.

Bar freshness, counted
Class	Count	Note
bars	0	sotabar rows on the plan
fresh	0	the bar month is the current month
attested	0	an older bar with a this-month barscan reporting no newer entry
stale	0	a this-month scan saw a newer month the bar ignores
unattested	0	nobody looked this month
malformed	0	a sotabar row missing a field
duplicate	0	bar ids an earlier row already carries
bars, summed	0	RECONCILED: the parts sum to the total 0
current month	2026-10	the month every bar is judged against

Treatment verdict. NOT DECLARED. No rung on this board declares its three-step treatment (a treat row naming the MCP row, the API route, the primitive it composes, the workflow that composes it and the agent beat that runs it); the ranker labels every rung TREATMENT-UNDECLARED until it does.

Inspect a rung and its prerequisites

Declared nodes 6. Rank input binding: PLAN_MATRIX_BOUND_ONLY. Dependency order is authored. Implementation, acceptance evidence, authority and resource readiness are unverified. No action is recommended or dispatched here.

Plan SHA-256 ad01bca2b97ff6e6f65f568f430a24a5b0ab1dce4122f1282c1e3b5032d65a6c. Target rows 0; role rows 0. Existing risks and release worklog retain their own scope; no node completion is inferred.

Runtime observation coverage: 0 of 6 rungs have current, identity-bound execution observations. Observation may report RED. Accepted completion remains unknown; source presence, qualification and deployment do not establish it.

Use Enter or Space on a rung to inspect its contract. Prerequisite links locate another rung in this list; open its summary to inspect it. Estimates are authored effort, not forecasts.

B1 — Dead-code elimination (reachability)
Prerequisites: None declared; this does not establish execution eligibility.
Contract: opt_module_dce_mark
Acceptance: LANDED 2026-08-18 (actual 1 u vs estimate 2): mark-only reachability from main (opt_module_dce_mark in nx_opt.nx, consumed by the opt loop and x86ctx_emit_module_live, --no-dce as the A/B lever). RE-KEYED 2026-08-23 from cc_gc_unreached (never defined anywhere, ABSENT-PROVEN over 23,071 files) to the symbol that shipped, so the board stops ranking a landed rung first. DONE-RULE MEASURED 2026-08-23 on the live toolchain (nx_cc_sovereign 0288e2ea, /api/build himport = import nx_syscalls + a main calling sys_exit): asm 976 lines / 32,488 B / 10 functions (main, sys_exit, the 8-function default-on crash guard) / binary 7,126 B, down from the 4,311-line whole-closure emission. Original done-rule: the equivalence gate stays GREEN (every estate binary rebuilds byte- or behaviour-identical) AND a trivial main's asm drops from 4,311 lines toward its actual reachable set. A DCE that drops a reached function is a miscompile, and a missed edge is a LOUD undefined-label assemble failure, never a wrong binary.
Authored effort: 2. Executor kind: Compiler. Responsible, accountable and verifier not established. Inspect retained worklog.
Runtime observation: UNKNOWN; outcome UNKNOWN; observed epoch -1. Declared owner: . Receipt , SHA-256 . Identity-bound observation is not accepted completion. Qualification and deployment remain unverified by this projection.
B2 — Content-addressed build cache
Prerequisites: None declared; this does not establish execution eligibility.
Contract: bld_cache_cas
Acceptance: Key a cache on (src_sha256 + closure_sha256 + toolchain_sha) -> cached .sov.elf; hit = copy, miss = build + populate. DONE-RULE: an unchanged rebuild returns byte-identical bytes with ZERO compiler invocation (proven by a fork counter) and a one-byte source edit MISSES. The daily ~1000-binary drift census becomes file-copies.
Authored effort: 2. Executor kind: Organ. Responsible, accountable and verifier not established. Inspect retained worklog.
Runtime observation: UNKNOWN; outcome UNKNOWN; observed epoch -1. Declared owner: . Receipt , SHA-256 . Identity-bound observation is not accepted completion. Qualification and deployment remain unverified by this projection.
B3 — Separate compilation / precompiled closure
Prerequisites: B1 (acceptance unverified)
Contract: cc_emit_object
Acceptance: Compile the shared base closure (syscalls, sha256, bits, gate_verdict) ONCE to a cached object with a symbol table; a target build emits only its own functions and links. DONE-RULE: equiv gate GREEN AND a gate build's compile time drops from ~80ms toward the ~5ms floor, measured. The big architectural rung.
Authored effort: 4. Executor kind: Compiler+linker. Responsible, accountable and verifier not established. Inspect retained worklog.
Runtime observation: UNKNOWN; outcome UNKNOWN; observed epoch -1. Declared owner: . Receipt , SHA-256 . Identity-bound observation is not accepted completion. Qualification and deployment remain unverified by this projection.
B4 — Cost-aware parallel scheduler
Prerequisites: B2 (acceptance unverified)
Contract: bld_sched_parallel
Acceptance: Replace the BUILD-ADMIT load-serialize with a scheduler that runs the build DAG across cores up to a measured memory/CPU envelope. DONE-RULE: N independent builds complete in ~max(one) not ~sum, no OOM and no edge 503 on a declared batch.
Authored effort: 3. Executor kind: Organ. Responsible, accountable and verifier not established. Inspect retained worklog.
Runtime observation: UNKNOWN; outcome UNKNOWN; observed epoch -1. Declared owner: . Receipt , SHA-256 . Identity-bound observation is not accepted completion. Qualification and deployment remain unverified by this projection.
B5 — Remote / distributed build cache
Prerequisites: B2 (acceptance unverified)
Contract: bld_cache_remote
Acceptance: The B2 cache shared across hosts, content-addressed and integrity-checked on fetch. DONE-RULE: a second host reuses the first's cached artifact after proving its hash. Beyond parity.
Authored effort: 3. Executor kind: Organ. Responsible, accountable and verifier not established. Inspect retained worklog.
Runtime observation: UNKNOWN; outcome UNKNOWN; observed epoch -1. Declared owner: . Receipt , SHA-256 . Identity-bound observation is not accepted completion. Qualification and deployment remain unverified by this projection.
B6 — Node self-host proof against the hub compiler (baseline-as-data equiv gate + freshness-checked bless)
Prerequisites: None declared; this does not establish execution eligibility.
Contract: eq_first_line
Acceptance: LANDED 2026-09-15 on the laptop node (actual 1 u): a node builds nx_compile_x86 from the converged source with its live compiler, pulls the HUB's promoted compiler through nx_content_get (whole-file digest verified before a byte is written) and names it on line 1 of knowledge/cc_equiv_baseline.conf; nx_cc_equiv_gate then judges the candidate DIFFERENTIALLY against the hub over all 10 corpus rows plus the self-host stage, printing the bytes of both compilers and refusing a self-comparison or an unresolvable conf by name; nx_bless_compiler installs it with a .bak and a game-gate post-verify, reading a verdict that is FRESH by epoch at the path the anchored gate writes. DONE-RULE: rows=10 passed=10 selfhost=1 baseline_cannot_build=0 verdict=GREEN against the hub baseline, BLESSED+VERIFIED, and the blessed compiler rebuilds itself byte-identical. MEASURED: laptop live compiler 867366 B (Sep 3, no __size_of) to 880434 B sha 2c039ca0; gen3 rebuild byte-identical; nx_swcompare_matrix compile proof went from 20 parse errors to 0.
Authored effort: 1. Executor kind: Organ. Responsible, accountable and verifier not established. Inspect retained worklog.
Runtime observation: UNKNOWN; outcome UNKNOWN; observed epoch -1. Declared owner: . Receipt , SHA-256 . Identity-bound observation is not accepted completion. Qualification and deployment remain unverified by this projection.

Learning and practice paths

No structured learning path is declared for this plan. Existing research, roadmap and worklog remain available above.

Rung dossiers — every record that bears on a rung, in one place

Joined by symbol, never typed. Each dossier is assembled on every publish from the rows this board already carries: the plan's rung row, the matrix row that carries its contract symbol (its status re-measured by the one symbol ruler), the gate the organ declares and the verdict the evidence referee recorded on its last run, the reference marks in the rung text, the design rows that name the rung and the work log filed against it. The capability matrix links each cell to its dossier and each dossier links back to its cell and forward to the rungs it stands on; a dependency naming no rung on this plan is written as UNRESOLVED rather than linked. Absences are named: NO-MATRIX-ROW, NO-GATE-DECLARED, UNRECORDED.

Gate verdicts: UNSTAMPED — no per-gate verdict artifact is published for this domain yet (nx_swcompare_evidence toolchain writes it beside its stamp); every gate below reads UNRECORDED until it runs.

Gate declarations: knowledge/organ_gate.conf read from this working directory (1 rows) and from the estate root (196 rows); rows in both counted once: 0; declarations read: 197. Every declaration in either copy counts, so a stub beside the publisher can never hide the root.

B1 Dead-code elimination (reachability) · cell LANDED · gate NO-GATE-DECLARED

Contract	`opt_module_dce_mark` · executor Compiler · 2 u · stands on nothing
Definition of done	LANDED 2026-08-18 (actual 1 u vs estimate 2): mark-only reachability from main (opt_module_dce_mark in nx_opt.nx, consumed by the opt loop and x86ctx_emit_module_live, --no-dce as the A/B lever). RE-KEYED 2026-08-23 from cc_gc_unreached (never defined anywhere, ABSENT-PROVEN over 23,071 files) to the symbol that shipped, so the board stops ranking a landed rung first. DONE-RULE MEASURED 2026-08-23 on the live toolchain (nx_cc_sovereign 0288e2ea, /api/build himport = import nx_syscalls + a main calling sys_exit): asm 976 lines / 32,488 B / 10 functions (main, sys_exit, the 8-function default-on crash guard) / binary 7,126 B, down from the 4,311-line whole-closure emission. Original done-rule: the equivalence gate stays GREEN (every estate binary rebuilds byte- or behaviour-identical) AND a trivial main's asm drops from 4,311 lines toward its actual reachable set. A DCE that drops a reached function is a miscompile, and a missed edge is a LOUD undefined-label assemble failure, never a wrong binary.
Matrix cell	LIVE: Dead-code elimination (emit only reachable functions) · `runtime/nx_opt.nx` · LANDED decl
Gate	NO-GATE-DECLARED — `knowledge/organ_gate.conf` carries no row for `nx_opt`; declare `nx_opt TAB <gate>` and the ship loop proves it and the verdict lands here.
Work log	2026-09-21 measure OPEN compiler forward-layout debt: native minimal nx_forward_struct_layout_probe1790017840 compiles but emits literal zero and fails0/1; same573B fixture with struct declared before reader nx_declared_struct_layout_probe1790017860 passes1/1. Retained witness buildroot/knowledge/gates/compiler-forward-struct-layout-witness.json. Owner compiler frontend/type-layout; PM coordinates. Require correct deferred layout or named compile refusal, not silent zero. Independent of private tail-frame repair; no serving compiler change.

B2 Content-addressed build cache · cell LANDED · gate UNRECORDED

Contract	`bld_cache_cas` · executor Organ · 2 u · stands on nothing
Definition of done	Key a cache on (src_sha256 + closure_sha256 + toolchain_sha) -> cached .sov.elf; hit = copy, miss = build + populate. DONE-RULE: an unchanged rebuild returns byte-identical bytes with ZERO compiler invocation (proven by a fork counter) and a one-byte source edit MISSES. The daily ~1000-binary drift census becomes file-copies.
Matrix cell	GAP: Content-addressed build cache (never rebuild identical) · `runtime/_hdl_build/nx_sov_build_run.nx` · LANDED decl
Gate	`nx_bld_cache_cas_gate` · UNRECORDED — no recorded verdict for this gate (it is declared for the organ but the evidence referee's last run did not record it: it is not on this board's gates map, or the referee has not run since the per-gate record shipped)
Work log	2026-09-07 measure 2026-09-07 release worklog: debug cache repair is BUILDING-CANDIDATE, not deployed. Isolated acceptance: 14/14 gate plus real STORE/HIT byte identity and same-source alias MISS with correct source paths (jobs 1788805149, 1788805302, 1788805332, 1788805333). Current serving runner remains SHA099f5d12. Next: canonical no-cache build, full content review and recovery hash verification before promotion. Normal resource admission remains enabled. 2026-09-07 land Debug cache identity repair deployed to both runner roots: SHA89284080fe1b73bf45165a925a73d2edd320a76dd20d2fd0438af0ed4b0476ad, 154240 bytes (independent match6134). Debug keys now include logical root source path; release key compatibility preserved. Puregate14/14, actual same-source alias MISS, canonical contentdiff3/3, fresh canary8/8. Postdeployment HIT6150 ran no compiler and independent comparison6184 matched retained no-cache bytes. Previous artifacts retained. This repairs the observed root filename collision, not every possible import-resolution or cross-host identity issue. 2026-09-08 measure 2026-09-08: toolchain promotion refusal repair staged and promoted through mgmtapi with no guard override. Management candidate/live-file SHA961375393d9d9a2f56c3eae65e924d4efee1b4c13fa1fd11d451c9becb9d9ce8,739288B; previous SHA f3741c7eb36269a7b3d80c6a90a6ea0b098fa275d61c7036ee8e87414d3ebb28 retained. Actual installer+HTTP refusal boundary passed32/32 local and NAS4655, including repeated provenance refusal, invalid stage, valid installation and exact rollback. Negative-control old zero-only refusal logic failed6/25. Watchdog says DEPLOYED-GREEN listen=UNVERIFIED-may-be-outgoing-process: running listener identity remains unverified; file identity is not runtime identity. No Beach visual/FPS improvement claimed. Existing runner misparses --toolchain-refusal as --timeout-ms because it tests only flag initial; positional toolchain-refusal mode worked. Exact flag parsing and runtime release receipts remain shared capability debt. 2026-09-08 land 2026-09-08 API-build runner promoted through /api/promote_toolchain, canary8/8 GREEN. API consumer buildroot/_offc/nx_sov_build_run.elf now154192B SHAe7c68f4e9913357ac016d0b7134b17fba33cecb034ee431a36c58d62d382965d; previous89284080fe1b73bf45165a925a73d2edd320a76dd20d2fd0438af0ed4b0476ad retained and independently hashed. Earlier61/61 cache qualification includes fresh compiles; promotion canary itself was a verified cache HIT, not a fresh compile. Removes duplicate key computation and payload reads for cache-size accounting; speedup not yet measured. Management running process3062 executable hash961375393d9d9a2f56c3eae65e924d4efee1b4c13fa1fd11d451c9becb9d9ce8 verified twice via /proc/3062/exe. Shared nx_heal diagnose found process through existing API; its restart-loop inference from request children is unsupported. MCP root runner remains old89284080; do not claim all consumers updated. No Beach visuals/FPS change. 2026-09-08 land 2026-09-08 API and MCP runner convergence verified. Existing guarded organ promotion installed the already-canaried artifact; root nx_sov_build_run.elf, _offc mirror and buildroot/_offc all154192B SHAe7c68f4e9913357ac016d0b7134b17fba33cecb034ee431a36c58d62d382965d. Root previous89284080 retained. Staging503 outcome reconciled by artifact hash, no repeated write. Post-release MCP run5950 reused verified cache bytes without compiler invocation and passed10/10 real proc-reader checks. API fresh-compile path5611 independently succeeded after existing gate adopted shared machine-readable verdicts. No measured build-speedup or Beach graphics/FPS claim; exact argument parsing, runtime-identity receipt composition and calibrated resource attribution remain open. 2026-09-08 land 2026-09-08 Lossless API argument delivery released. /api/organ_run now supports args_encoding=percent-v1: separate tokens with + and encode internal bytes, for example args=https%3A%2F%2Fnishifamily.com%2F+--hdr+Accept-Encoding%3A%20identity. Existing legacy alphabet remains valid; unsupported legacy bytes, malformed escapes, control bytes and capacity overflow return ORGAN_ARGS_INVALID with executed:false. NAS parser23/23 and existing API35/35 passed; live argecho7596 received URL and header exactly, refusal7572 and7619 returned400. Running PID9766 executable741920B SHAc6e637f0000861d954f0a11652577f404e55f140ea72935f9f2c3b1a8bffe6dd verified; previous96137539 retained. API fetch7620 reached HTTP but returned NAS404; process exit0 is not HTTP success. No Beach visual or performance claim.

B3 Separate compilation / precompiled closure · cell WATCHING · gate UNRECORDED

Contract	`cc_emit_object` · executor Compiler+linker · 4 u · stands on B1
Definition of done	Compile the shared base closure (syscalls, sha256, bits, gate_verdict) ONCE to a cached object with a symbol table; a target build emits only its own functions and links. DONE-RULE: equiv gate GREEN AND a gate build's compile time drops from ~80ms toward the ~5ms floor, measured. The big architectural rung.
Matrix cell	GAP: Separate compilation (per-module cached objects) · `runtime/nx_compile_x86.nx` · WATCHING decl
Gate	`nx_chkarith_gate` · UNRECORDED — no recorded verdict for this gate (it is declared for the organ but the evidence referee's last run did not record it: it is not on this board's gates map, or the referee has not run since the per-gate record shipped) `nx_optenforce_gate` · UNRECORDED — no recorded verdict for this gate (it is declared for the organ but the evidence referee's last run did not record it: it is not on this board's gates map, or the referee has not run since the per-gate record shipped) `nx_boundscheck_gate` · UNRECORDED — no recorded verdict for this gate (it is declared for the organ but the evidence referee's last run did not record it: it is not on this board's gates map, or the referee has not run since the per-gate record shipped) `nx_opt_eqsat_wire_gate` · UNRECORDED — no recorded verdict for this gate (it is declared for the organ but the evidence referee's last run did not record it: it is not on this board's gates map, or the referee has not run since the per-gate record shipped) `nx_x86_regalloc_use_gate` · UNRECORDED — no recorded verdict for this gate (it is declared for the organ but the evidence referee's last run did not record it: it is not on this board's gates map, or the referee has not run since the per-gate record shipped)
Work log	no log row names this rung yet

B4 Cost-aware parallel scheduler · cell WATCHING · gate UNRECORDED

Contract	`bld_sched_parallel` · executor Organ · 3 u · stands on B2
Definition of done	Replace the BUILD-ADMIT load-serialize with a scheduler that runs the build DAG across cores up to a measured memory/CPU envelope. DONE-RULE: N independent builds complete in ~max(one) not ~sum, no OOM and no edge 503 on a declared batch.
Matrix cell	GAP: Parallel build scheduler (beyond the load throttle) · `runtime/_hdl_build/nx_sov_build_run.nx` · WATCHING decl
Gate	`nx_bld_cache_cas_gate` · UNRECORDED — no recorded verdict for this gate (it is declared for the organ but the evidence referee's last run did not record it: it is not on this board's gates map, or the referee has not run since the per-gate record shipped)
Work log	no log row names this rung yet

B5 Remote / distributed build cache · cell WATCHING · gate UNRECORDED

Contract	`bld_cache_remote` · executor Organ · 3 u · stands on B2
Definition of done	The B2 cache shared across hosts, content-addressed and integrity-checked on fetch. DONE-RULE: a second host reuses the first's cached artifact after proving its hash. Beyond parity.
Matrix cell	GAP: Remote / distributed build cache + farm · `runtime/_hdl_build/nx_sov_build_run.nx` · WATCHING decl
Gate	`nx_bld_cache_cas_gate` · UNRECORDED — no recorded verdict for this gate (it is declared for the organ but the evidence referee's last run did not record it: it is not on this board's gates map, or the referee has not run since the per-gate record shipped)
Work log	no log row names this rung yet

B6 Node self-host proof against the hub compiler (baseline-as-data equiv gate + freshness-checked bless) · cell PRESENT · gate NO-GATE-DECLARED

Contract	`eq_first_line` · executor Organ · 1 u · stands on nothing
Definition of done	LANDED 2026-09-15 on the laptop node (actual 1 u): a node builds nx_compile_x86 from the converged source with its live compiler, pulls the HUB's promoted compiler through nx_content_get (whole-file digest verified before a byte is written) and names it on line 1 of knowledge/cc_equiv_baseline.conf; nx_cc_equiv_gate then judges the candidate DIFFERENTIALLY against the hub over all 10 corpus rows plus the self-host stage, printing the bytes of both compilers and refusing a self-comparison or an unresolvable conf by name; nx_bless_compiler installs it with a .bak and a game-gate post-verify, reading a verdict that is FRESH by epoch at the path the anchored gate writes. DONE-RULE: rows=10 passed=10 selfhost=1 baseline_cannot_build=0 verdict=GREEN against the hub baseline, BLESSED+VERIFIED, and the blessed compiler rebuilds itself byte-identical. MEASURED: laptop live compiler 867366 B (Sep 3, no __size_of) to 880434 B sha 2c039ca0; gen3 rebuild byte-identical; nx_swcompare_matrix compile proof went from 20 parse errors to 0.
Matrix cell	LIVE: Node self-host proof against the hub compiler (baseline-as-data equiv gate, freshness-checked bless) · `runtime/nx_cc_equiv_gate.nx` · PRESENT decl
Gate	NO-GATE-DECLARED — `knowledge/organ_gate.conf` carries no row for `nx_cc_equiv_gate`; declare `nx_cc_equiv_gate TAB <gate>` and the ship loop proves it and the verdict lands here.
Work log	2026-09-15 measure 2026-09-15 laptop node: candidate = nx_compile_x86 built from the converged source (17 closure files hash-identical laptop vs NAS) by the Sep-3 live compiler. Against the LIVE baseline nx_cc_equiv_gate read rows=10 passed=5, the 5 failures all build_a=1 build_b=0 (nx_sha256 uses __size_of over a struct type; the old compiler lacks it) so no differential existed. Against the HUB baseline (buildroot/_offc/nx_cc_sovereign.elf 975008 B sha 79541ff9, pulled by nx_content_get_client in 8 chunks, digest verified) it read rows=10 passed=10 selfhost=1 baseline_cannot_build=0 verdict=GREEN; planted controls: a challenger byte-identical to the baseline refused BASELINE-IS-CHALLENGER exit 4, a conf naming a missing path refused BASELINE-CONF-UNREADABLE exit 4. 2026-09-15 land nx_cc_equiv_gate.nx (both laptop trees, sha e436f84f): baseline as DATA from knowledge/cc_equiv_baseline.conf with baseline_src and byte sizes printed, BASELINE-IS-CHALLENGER and BASELINE-CONF-UNREADABLE refusals, LOG-UNWRITABLE refusal after an idempotent mkdir of knowledge/status, per-row product unlink so ea/eb never report the previous row, FAIL classes named (baseline-cannot-build, neither-side-builds, challenger-cannot-build, behaviour-differs-or-vacuous), baseline_cannot_build= in the summary before verdict=. nx_bless_compiler.nx (sha b34e29bd): verdict reader takes the log path and the bless epoch and refuses a line older than the bless, log path and challenger stage derived once from the located root, source-built gate fallback that PASSES the challenger, _build/nx_game_gate.sov.elf probe. Laptop: bless NEUTRAL read game gate 0 vs 0 fails, equiv last_epoch equal to bless_t0, BLESSED+VERIFIED; live _offc/nx_cc_sovereign.elf 880434 B sha 2c039ca0 (.bak 867366 B sha 1d3d647d, also banked as nx_cc_sovereign.elf.bank-pre-sizeof-0915-1d3d647d); gen3 rebuild byte-identical; nx_content_get_client and nx_content_put_client now build through nx_sov_build_run with 0 errors. NAS sources NOT yet landed. 2026-09-15 lesson A relative challenger path handed to a gate that anchors into buildroot named a Sep-4 fossil in buildroot/_build instead of the candidate in nxc2/_build, and the gate printed the caller's string as the identity: print the bytes of every binary a gate execs. A verdict reader that opens a log at a path the writer never writes reads a fossil as fresh: freshness is part of a verdict, and the reader and writer must derive the path from one place. A gate rule of both-sides-must-build can never pass a capability-adding compiler; the honest exit is a baseline that builds the corpus, never a looser rule. 2026-09-15 queue Land the two sources on the NAS (buildroot/runtime/nx_cc_equiv_gate.nx and _hdl_build/nx_bless_compiler.nx) with pre and post hashes, then build, promote and register nx_cc_equiv_gate when the box frees (cross-encoder run pid 18061 is saturating it); adjudicate the NAS four-way compiler drift (buildroot/_offc 975008, _build 976040, staged 974912, serving root 957128); the LOG-UNWRITABLE refusal is unexercised on purpose (planting it needs an unwritable directory).

dossiers=6 cells_joined=6 no_matrix_row=0 (sum 6) gates_recorded=0 gates_unrecorded=4 no_gate_declared=2 (sum 6 of cells_joined) evgates=UNSTAMPED

Capability comparisons

Compare the field, search individual capabilities and open their source and adoption evidence. Documented presence does not establish comparative quality.

Position map — centrality and distinctiveness

The four-quadrant map the field uses for brand strategy (Dawar and Bagga, HBR June 2015), re-derived from this matrix on every publish. Centrality is the share of the category's feature mass a player covers, each feature weighted by how many hold it; distinctiveness is the average lead over each rival on the rows the player holds; breadth is the depth-weighted share of the whole matrix (the bubble); depth is how deeply the rows held are held; momentum is the day-over-day move off the spine (green rising, red falling, grey until day two); the dashed path runs first day → previous day → today. Dividers are the category means. Axes are fitted to the field of play, so read the tick numerals, not the frame. Rival marks are documented presence, so a rival's position reads the record, never its quality. The picture grades its own readability below; the table beside it is the same data for a screen reader or a second method.

Rows. 15 feature rows mapped of 15 matrix rows; 0 substrate rows (kernels, bounds and instruments the plan's rungrole marks substrate) are the estate's scaffolding, not category features, and stay off the map

Views. 2D cut: centrality, distinctiveness · 3D cube: centrality, distinctiveness, breadth · axes registered: centrality, distinctiveness, breadth, depth, momentum · a board picks its own in knowledge/compare/toolchain.cdmap (cut|x|y, cube|x|y|z); absent = the HBR defaults

bubble area = breadth · ring = momentum (green rising, red falling, grey until day two) · dashed = category means · axes fitted to the field of play: centrality 700–1000, distinctiveness 0–300 of 0–1000 permil (the full range put every player in one corner)
readability of the 2D cut, self-graded by the layout ruler: label overlaps 0 · labels over marks 0 · off-canvas 0 · unresolved labels 0 · mark overlaps 0 (a fact of the data: two players that close are that close) · data spread 650 permil of the plot · quadrant words unseated 0
text contrast, measured with wcag2-ratio (floors from contrast.conf), light theme: labels 16.24 (floor 4.50) · notes 16.24 (floor 4.50) · quadrant words 5.89 (floor 4.50) · tick numerals 5.89 (floor 4.50) · axis titles 5.59 (floor 4.50) · dark theme: labels 13.78 (floor 4.50) · quadrant words 5.55 (floor 4.50) · axis titles 5.97 (floor 4.50) · dark classes under their floor 0 (one figure serves both themes: a dark shortfall is a token to fix, never a class to hide) · classes refused under their floor 0 (a refused class is not drawn; the scale classes are measured, never hidden) · export: SVG PNG (receipt, rendered by the estate's own rasteriser from this page)

axes fitted: centrality 700–1000 · distinctiveness 0–300 · breadth 500–750 permil · farther bubbles are painted first, nearer ones over them · the floor shadow is each bubble's (x, y) at height 0
readability of the 3D cube, self-graded by the layout ruler: label overlaps 0 · labels over marks 0 · off-canvas 0 · unresolved labels 0 · mark overlaps 0 (a fact of the data: two players that close are that close) · data spread 361 permil of the plot

Nishi Clang/LLVM Go Rust/Cargo Zig
10 panels over 5 registered axes, every pair once (the lower axis on x, the higher on y) · each panel fitted to its own field of play, first and last tick numerals shown · no labels in a small cut, the legend names the colours; the grade below reports the mark terms only (MM summed over the panels, spread averaged)
readability of the small multiples, self-graded by the layout ruler: label overlaps 0 · labels over marks 0 · off-canvas 0 · unresolved labels 0 · mark overlaps 7 (a fact of the data: two players that close are that close) · data spread 531 permil of the plot

Player	Quadrant	centrality	distinctiveness	breadth	depth	momentum	Rows held	Days on spine	First seen
Nishi	Unconventional	765	242	555	757	0 since 2026-09-23	11	10	2026-09-15
Clang/LLVM	Aspirational	937	153	644	743	0 since 2026-09-23	13	10	2026-09-15
Go	Aspirational	984	160	688	738	0 since 2026-09-23	14	10	2026-09-15
Rust/Cargo	Mainstream	937	115	622	717	0 since 2026-09-23	13	10	2026-09-15
Zig	Mainstream	937	70	555	641	0 since 2026-09-23	13	10	2026-09-15

Day	Matrix rows reviewed	Players recorded
2026-09-15	14	5
2026-09-16	15	5
2026-09-17	15	5
2026-09-18	15	5
2026-09-19	15	5
2026-09-20	15	5
2026-09-21	15	5
2026-09-22	15	5
2026-09-23	15	5
2026-10-08	15	5

How to read this evidence. A Nishi source mark records whether the named symbol is declared in the selected source file. It does not establish working behavior or accepted delivery. A watching tag names an expected source entry; discovering it updates source coverage only. A dark tag means the file exists but the named symbol was not found: inspect the source and contract before assuming the capability is missing or renaming code. Peer codes are authored assessments; unassessed means no comparison is established, not absence. Qualification, deployment identity, runtime observations and acceptance must carry their own evidence. Adoption records the catalog's observed path through source, build, promotion, registration and invocation; libraries use importer evidence and gates use declared execution surfaces. A full catalog path does not establish quality, freshness or a successful user outcome. Partial and unknown states retain their stated next action. Census stamps: importers asof 1790637268, gate census asof 1790104131 (unix seconds; -1 = census absent).

Capability matrix — measured against source

◉ authored stronger claim; source present● present◐ partial○ absent? unassessed; excluded from relative comparison · click any capability for its evidence

Peer cell coverage: authored assessed 60, unassessed 0. Authored assessments are not verified outcomes.

Capability	Nishi	Clang/LLVM	Go	Rust/Cargo	Zig
LIVE
Self-hosted bits-up toolchain (no gcc/llvm/binutils) Source present; authored stronger claim: `sbr_is_toolchain` in `runtime/_hdl_build/nx_sov_build_run.nx`, verified at emit. nx_cc_sovereign + nxasm_x86, sovereign to the byte; Go self-hosts, Zig self-hosting, Rust rides LLVM, Clang is a vast C++ dep rival marks uncited — the Yes, Best or Part codes on this row are an observation read with no reference mark behind them Adoption: `RUN-BY:actlog` — fully adopted (top of its ladder). Pros Source symbol found; stronger capability claim is authored; ahead of Clang/LLVM, Go, Rust/Cargo, Zig; fully adopted on the estate ladderCons none on the measured axes (rival marks are documented presence, not depth)	◉	○	●	○	◐
Deterministic reproducible build (bit-exact, content-hashed) Source present; authored stronger claim: `sbr_mtime` in `runtime/_hdl_build/nx_sov_build_run.nx`, verified at emit. EXCEED: integer codegen + closure_sha256 => byte-identical rebuild PROVES a refactor neutral; reproducible builds are an industry ASK, ours is by construction [reproducible-builds] Adoption: `RUN-BY:actlog` — fully adopted (top of its ladder). Pros Source symbol found; stronger capability claim is authored; ahead of Clang/LLVM, Go, Rust/Cargo, Zig; fully adopted on the estate ladderCons none on the measured axes (rival marks are documented presence, not depth)	◉	◐	◐	◐	◐
Never-brick-the-builder / no accidental daemon deploy Source present; authored stronger claim: `sbr_is_daemon` in `runtime/_hdl_build/nx_sov_build_run.nx`, verified at emit. EXCEED: the lane REFUSES to install a toolchain binary or hot-swap a daemon as a build side effect; no mainstream tool guards its own blast radius Adoption: `RUN-BY:actlog` — fully adopted (top of its ladder). Pros Source symbol found; stronger capability claim is authored; ahead of Clang/LLVM, Go, Rust/Cargo, Zig; fully adopted on the estate ladderCons none on the measured axes (rival marks are documented presence, not depth)	◉	○	○	○	○
Dead-code elimination (emit only reachable functions) Measured: `opt_module_dce_mark` exists in `runtime/nx_opt.nx`, verified at emit. LANDED 2026-08-18 as opt_module_dce_mark (nx_opt.nx): mark-only reachability from main over OP_CALL/OP_TAIL_CALL callees + VK_FUNC_ADDR values, consumed by the opt loop and x86ctx_emit_module_live; --no-dce is the A/B lever and a missed edge is a LOUD undefined-label assemble failure, never a wrong binary. RE-KEYED 2026-08-23: the contract had watched cc_gc_unreached (ABSENT-PROVEN over 23,071 files) while the rung shipped under this name, so a LANDED rung sat OPEN on the board for five days. MEASURED 2026-08-23 on the LIVE promoted toolchain (nx_cc_sovereign 0288e2ea, /api/build himport = import nx_syscalls + main calling sys_exit): 976 asm lines / 32,488 B / 10 functions emitted (main, sys_exit, and the 8-function default-on crash guard) / binary 7,126 B -- against the pre-B1 whole-closure emission of 4,311 lines for a trivial main. --gc-sections is the industry form [ld-gc-sections] Adoption: `LIB-WIRED importers=53 nonval=49` — fully adopted (top of its ladder). dossier Pros Implementing source symbol found; runtime acceptance separate; fully adopted on the estate ladderCons behind Clang/LLVM (leads)	●	◉	●	●	●
GAP
Separate compilation (per-module cached objects) DARK — `runtime/nx_compile_x86.nx` EXISTS but does not declare `cc_emit_object`: something shipped at this path under another name, and this mark would read open forever. Repoint the contract to the real entry point (the plan rung AND this row) or rename the function; the flip follows on the next beat, and the `comparewatch-` plane row reads DARK until then. Every build recompiles the closure from source; Clang .o, Go packages [go-build-cache], Rust codegen-units, Zig compile a module ONCE and link. Est 80ms -> ~5ms dossierwatching cc_emit_object Pros none measured yetCons behind Clang/LLVM (leads), Go (leads), Rust/Cargo (leads), Zig (leads); open contract; expected source declaration not established	○	◉	◉	◉	◉
Incremental compilation (recompile only changed) DARK — `runtime/nx_compile_x86.nx` EXISTS but does not declare `cc_incremental`: something shipped at this path under another name, and this mark would read open forever. Repoint the contract to the real entry point (the plan rung AND this row) or rename the function; the flip follows on the next beat, and the `comparewatch-` plane row reads DARK until then. Rust [rustc-incremental] + Zig [zig-incremental] in-place incremental (2026 frontier) + Go package cache [go-build-cache] recompile only changed; ours rebuilds whole-program every time watching cc_incremental Pros none measured yetCons behind Clang/LLVM, Go (leads), Rust/Cargo (leads), Zig (leads); open contract; expected source declaration not established	○	●	◉	◉	◉
Content-addressed build cache (never rebuild identical) Measured: `bld_cache_cas` exists in `runtime/_hdl_build/nx_sov_build_run.nx`, verified at emit. closure_sha256 already computed -- key a cache on (src+closure+toolchain), hit=copy. ccache/Bazel reference [ccache-manual]. Turns the ~1000-binary daily drift census into file-copies Adoption: `RUN-BY:actlog` — fully adopted (top of its ladder). dossier Pros Implementing source symbol found; runtime acceptance separate; fully adopted on the estate ladderCons none on the measured axes (rival marks are documented presence, not depth)	●	●	●	●	●
Parallel build scheduler (beyond the load throttle) DARK — `runtime/_hdl_build/nx_sov_build_run.nx` EXISTS but does not declare `bld_sched_parallel`: something shipped at this path under another name, and this mark would read open forever. Repoint the contract to the real entry point (the plan rung AND this row) or rename the function; the flip follows on the next beat, and the `comparewatch-` plane row reads DARK until then. make -j / cargo / go schedule the DAG across cores [ninja-manual]; ours has a BUILD-ADMIT load gate that SERIALIZES under contention (what made a 35-build burst hit load 20). A cost-aware scheduler replaces the throttle dossierwatching bld_sched_parallel Pros none measured yetCons behind Clang/LLVM (leads), Go (leads), Rust/Cargo (leads), Zig; open contract; expected source declaration not established	○	◉	◉	◉	●
Remote / distributed build cache + farm DARK — `runtime/_hdl_build/nx_sov_build_run.nx` EXISTS but does not declare `bld_cache_remote`: something shipped at this path under another name, and this mark would read open forever. Repoint the contract to the real entry point (the plan rung AND this row) or rename the function; the flip follows on the next beat, and the `comparewatch-` plane row reads DARK until then. Bazel/Buck2 remote execution + fleet-shared cache [bazel-remote-cache] is the scale bar; ours is single-box. Far horizon dossierwatching bld_cache_remote Pros none measured yetCons behind Clang/LLVM (leads), Go, Rust/Cargo; open contract; expected source declaration not established	○	◉	●	●	○
LIVE
Whole-program compilation (cross-module inlining possible) Measured: `sbr_name_is` exists in `runtime/_hdl_build/nx_sov_build_run.nx`, verified at emit. Ours is whole-program BY DEFAULT (one .s per target) -- LTO-class cross-module visibility for free; LLVM ThinLTO [llvm-thinlto] / Rust fat-LTO are the optimizing reference Adoption: `RUN-BY:actlog` — fully adopted (top of its ladder). Pros Implementing source symbol found; runtime acceptance separate; ahead of Clang/LLVM, Rust/Cargo, Zig; fully adopted on the estate ladderCons none on the measured axes (rival marks are documented presence, not depth)	●	◐	●	◐	◐
Concurrent-safe builds (per-target flock, no mid-build clobber) Measured: `sbr_mtime` exists in `runtime/_hdl_build/nx_sov_build_run.nx`, verified at emit. Per-target _build/<name>.lock so parallel sweeps never overwrite each other mid-build; throughput is the GAP rows rival marks uncited — the Yes, Best or Part codes on this row are an observation read with no reference mark behind them Adoption: `RUN-BY:actlog` — fully adopted (top of its ladder). Pros Implementing source symbol found; runtime acceptance separate; fully adopted on the estate ladderCons none on the measured axes (rival marks are documented presence, not depth)	●	●	●	●	●
Build admission control (mem + load gated from /proc) Measured: `sbr_is_daemon` exists in `runtime/_hdl_build/nx_sov_build_run.nx`, verified at emit. BUILD-ADMIT reads live /proc mem+load and GRANTS or defers before compiling; thresholds are named consts, argv-overridable. make/cargo/go have no memory-aware admission rival marks uncited — the Yes, Best or Part codes on this row are an observation read with no reference mark behind them Adoption: `RUN-BY:actlog` — fully adopted (top of its ladder). Pros Implementing source symbol found; runtime acceptance separate; fully adopted on the estate ladderCons none on the measured axes (rival marks are documented presence, not depth)	●	●	●	●	●
Build + run in one invocation (exit == the program's exit) Measured: `sbr_mtime` exists in `runtime/_hdl_build/nx_sov_build_run.nx`, verified at emit. nx_sov_build_run compiles -> assembles -> runs and returns the program's own exit; go run / cargo run are the edit-run-loop reference rival marks uncited — the Yes, Best or Part codes on this row are an observation read with no reference mark behind them Adoption: `RUN-BY:actlog` — fully adopted (top of its ladder). Pros Implementing source symbol found; runtime acceptance separate; fully adopted on the estate ladderCons behind Go (leads)	●	●	◉	●	●
Optimizing backend (regalloc, sibcall, LICM, SIMD/AVX2) Measured: `sbr_name_is` exists in `runtime/_hdl_build/nx_sov_build_run.nx`, verified at emit. nxasm_x86 carries real codegen (elf history: sibcall/licm/prealloc/f32x8/avx2/clmul); LLVM -O3 is the reference, ours a focused subset rival marks uncited — the Yes, Best or Part codes on this row are an observation read with no reference mark behind them Adoption: `RUN-BY:actlog` — fully adopted (top of its ladder). Pros Implementing source symbol found; runtime acceptance separate; fully adopted on the estate ladderCons behind Clang/LLVM (leads), Rust/Cargo (leads)	●	◉	●	◉	●
Node self-host proof against the hub compiler (baseline-as-data equiv gate, freshness-checked bless) Measured: `eq_first_line` exists in `runtime/nx_cc_equiv_gate.nx`, verified at emit. LANDED 2026-09-15 (rung B6): a node pulls the hub's promoted compiler through nx_content_get (whole-file digest verified), names it on line 1 of knowledge/cc_equiv_baseline.conf, and nx_cc_equiv_gate judges a source-built candidate DIFFERENTIALLY against it over 10 corpus rows plus self-host, printing both compilers' byte sizes and refusing a self-comparison or an unresolvable conf by name; nx_bless_compiler installs with .bak and a game-gate post-verify on a verdict FRESH by epoch. Measured on the laptop: rows=10 passed=10 selfhost=1 GREEN vs the hub, BLESSED+VERIFIED, gen3 rebuild byte-identical. Go, Rust, Zig and LLVM distribute a toolchain verified by checksum; none proves a node-built compiler behaviourally equivalent to the hub's before installing it rival marks uncited — the Yes, Best or Part codes on this row are an observation read with no reference mark behind them Adoption: `GATE:DEPLOYED-DARK trial=RED` — PARTIAL: deployed, no execution surface runs it: admit it to the gate roster. dossiernot adopted: deployed, no execution surface runs it: admit it to the gate roster Pros Implementing source symbol found; runtime acceptance separateCons not adopted yet: deployed, no execution surface runs it: admit it to the gate roster	●	●	●	●	●

Rival-claim provenance. Every Yes, Best or Part mark in a rival column is a claim about someone else's product. A cited row carries a reference mark that resolves to a pinned mirror (the refs gate measures that); an uncited row is an observation read and is badged in its evidence until a reference lands. The badge is the receipt, never the proof: a mark proves a mirror exists, not that the mirror supports the code. The rows are counted below.

Rival claims, counted
Class	Count	Note
rows with rival marks	14	rows carrying a Yes, Best or Part in a rival column
cited	8	a reference mark resolves to a pinned mirror
uncited	6	an observation read, badged until a reference lands
rows, summed	14	RECONCILED: the parts sum to the total 14

Delivery and evidence

Inspect risks, technical debt, rendered observations, experiments and references. Read scope and limitations alongside every result.

Risk register

Risk	Likelihood x impact	Mitigation
A codegen or DCE change miscompiles the load-bearing compiler	possible x catastrophic	Every rung's done-rule is an EQUIVALENCE proof: rebuild the estate and byte/behaviour-compare before promoting; the compiler ships only through its own canaried lane, never hand-copied.
A cache returns a stale or wrong artifact	possible x high	Content-addressed keys (src+closure+toolchain hash); a hit is byte-verified before use; a key miss on any input change is the tooth.
Speed work erodes the determinism EXCEED	possible x high	Reproducibility is a shipping criterion: every rung re-proves byte-identical rebuild before it counts.

Release history and work log

The worked plan, on the board. Every leg appends what it measured, landed, retracted, learned and left queued, per rung, so a crash leaves the next seat a ledger here rather than a transcript to mine. Kinds: measure, land, retract, lesson, queue. Newest last.

When	Rung	Kind	Entry
2026-09-07	B2	measure	2026-09-07 release worklog: debug cache repair is BUILDING-CANDIDATE, not deployed. Isolated acceptance: 14/14 gate plus real STORE/HIT byte identity and same-source alias MISS with correct source paths (jobs 1788805149, 1788805302, 1788805332, 1788805333). Current serving runner remains SHA099f5d12. Next: canonical no-cache build, full content review and recovery hash verification before promotion. Normal resource admission remains enabled.
2026-09-07	B2	land	Debug cache identity repair deployed to both runner roots: SHA89284080fe1b73bf45165a925a73d2edd320a76dd20d2fd0438af0ed4b0476ad, 154240 bytes (independent match6134). Debug keys now include logical root source path; release key compatibility preserved. Puregate14/14, actual same-source alias MISS, canonical contentdiff3/3, fresh canary8/8. Postdeployment HIT6150 ran no compiler and independent comparison6184 matched retained no-cache bytes. Previous artifacts retained. This repairs the observed root filename collision, not every possible import-resolution or cross-host identity issue.
2026-09-08	B2	measure	2026-09-08: toolchain promotion refusal repair staged and promoted through mgmtapi with no guard override. Management candidate/live-file SHA961375393d9d9a2f56c3eae65e924d4efee1b4c13fa1fd11d451c9becb9d9ce8,739288B; previous SHA f3741c7eb36269a7b3d80c6a90a6ea0b098fa275d61c7036ee8e87414d3ebb28 retained. Actual installer+HTTP refusal boundary passed32/32 local and NAS4655, including repeated provenance refusal, invalid stage, valid installation and exact rollback. Negative-control old zero-only refusal logic failed6/25. Watchdog says DEPLOYED-GREEN listen=UNVERIFIED-may-be-outgoing-process: running listener identity remains unverified; file identity is not runtime identity. No Beach visual/FPS improvement claimed. Existing runner misparses --toolchain-refusal as --timeout-ms because it tests only flag initial; positional toolchain-refusal mode worked. Exact flag parsing and runtime release receipts remain shared capability debt.
2026-09-08	B2	land	2026-09-08 API-build runner promoted through /api/promote_toolchain, canary8/8 GREEN. API consumer buildroot/_offc/nx_sov_build_run.elf now154192B SHAe7c68f4e9913357ac016d0b7134b17fba33cecb034ee431a36c58d62d382965d; previous89284080fe1b73bf45165a925a73d2edd320a76dd20d2fd0438af0ed4b0476ad retained and independently hashed. Earlier61/61 cache qualification includes fresh compiles; promotion canary itself was a verified cache HIT, not a fresh compile. Removes duplicate key computation and payload reads for cache-size accounting; speedup not yet measured. Management running process3062 executable hash961375393d9d9a2f56c3eae65e924d4efee1b4c13fa1fd11d451c9becb9d9ce8 verified twice via /proc/3062/exe. Shared nx_heal diagnose found process through existing API; its restart-loop inference from request children is unsupported. MCP root runner remains old89284080; do not claim all consumers updated. No Beach visuals/FPS change.
2026-09-08	B2	land	2026-09-08 API and MCP runner convergence verified. Existing guarded organ promotion installed the already-canaried artifact; root nx_sov_build_run.elf, _offc mirror and buildroot/_offc all154192B SHAe7c68f4e9913357ac016d0b7134b17fba33cecb034ee431a36c58d62d382965d. Root previous89284080 retained. Staging503 outcome reconciled by artifact hash, no repeated write. Post-release MCP run5950 reused verified cache bytes without compiler invocation and passed10/10 real proc-reader checks. API fresh-compile path5611 independently succeeded after existing gate adopted shared machine-readable verdicts. No measured build-speedup or Beach graphics/FPS claim; exact argument parsing, runtime-identity receipt composition and calibrated resource attribution remain open.
2026-09-08	B2	land	2026-09-08 Lossless API argument delivery released. /api/organ_run now supports args_encoding=percent-v1: separate tokens with + and encode internal bytes, for example args=https%3A%2F%2Fnishifamily.com%2F+--hdr+Accept-Encoding%3A%20identity. Existing legacy alphabet remains valid; unsupported legacy bytes, malformed escapes, control bytes and capacity overflow return ORGAN_ARGS_INVALID with executed:false. NAS parser23/23 and existing API35/35 passed; live argecho7596 received URL and header exactly, refusal7572 and7619 returned400. Running PID9766 executable741920B SHAc6e637f0000861d954f0a11652577f404e55f140ea72935f9f2c3b1a8bffe6dd verified; previous96137539 retained. API fetch7620 reached HTTP but returned NAS404; process exit0 is not HTTP success. No Beach visual or performance claim.
2026-09-15	B6	measure	2026-09-15 laptop node: candidate = nx_compile_x86 built from the converged source (17 closure files hash-identical laptop vs NAS) by the Sep-3 live compiler. Against the LIVE baseline nx_cc_equiv_gate read rows=10 passed=5, the 5 failures all build_a=1 build_b=0 (nx_sha256 uses __size_of over a struct type; the old compiler lacks it) so no differential existed. Against the HUB baseline (buildroot/_offc/nx_cc_sovereign.elf 975008 B sha 79541ff9, pulled by nx_content_get_client in 8 chunks, digest verified) it read rows=10 passed=10 selfhost=1 baseline_cannot_build=0 verdict=GREEN; planted controls: a challenger byte-identical to the baseline refused BASELINE-IS-CHALLENGER exit 4, a conf naming a missing path refused BASELINE-CONF-UNREADABLE exit 4.
2026-09-15	B6	land	nx_cc_equiv_gate.nx (both laptop trees, sha e436f84f): baseline as DATA from knowledge/cc_equiv_baseline.conf with baseline_src and byte sizes printed, BASELINE-IS-CHALLENGER and BASELINE-CONF-UNREADABLE refusals, LOG-UNWRITABLE refusal after an idempotent mkdir of knowledge/status, per-row product unlink so ea/eb never report the previous row, FAIL classes named (baseline-cannot-build, neither-side-builds, challenger-cannot-build, behaviour-differs-or-vacuous), baseline_cannot_build= in the summary before verdict=. nx_bless_compiler.nx (sha b34e29bd): verdict reader takes the log path and the bless epoch and refuses a line older than the bless, log path and challenger stage derived once from the located root, source-built gate fallback that PASSES the challenger, _build/nx_game_gate.sov.elf probe. Laptop: bless NEUTRAL read game gate 0 vs 0 fails, equiv last_epoch equal to bless_t0, BLESSED+VERIFIED; live _offc/nx_cc_sovereign.elf 880434 B sha 2c039ca0 (.bak 867366 B sha 1d3d647d, also banked as nx_cc_sovereign.elf.bank-pre-sizeof-0915-1d3d647d); gen3 rebuild byte-identical; nx_content_get_client and nx_content_put_client now build through nx_sov_build_run with 0 errors. NAS sources NOT yet landed.
2026-09-15	B6	lesson	A relative challenger path handed to a gate that anchors into buildroot named a Sep-4 fossil in buildroot/_build instead of the candidate in nxc2/_build, and the gate printed the caller's string as the identity: print the bytes of every binary a gate execs. A verdict reader that opens a log at a path the writer never writes reads a fossil as fresh: freshness is part of a verdict, and the reader and writer must derive the path from one place. A gate rule of both-sides-must-build can never pass a capability-adding compiler; the honest exit is a baseline that builds the corpus, never a looser rule.
2026-09-15	B6	queue	Land the two sources on the NAS (buildroot/runtime/nx_cc_equiv_gate.nx and _hdl_build/nx_bless_compiler.nx) with pre and post hashes, then build, promote and register nx_cc_equiv_gate when the box frees (cross-encoder run pid 18061 is saturating it); adjudicate the NAS four-way compiler drift (buildroot/_offc 975008, _build 976040, staged 974912, serving root 957128); the LOG-UNWRITABLE refusal is unexercised on purpose (planting it needs an unwritable directory).
2026-09-21	B1	measure	OPEN compiler forward-layout debt: native minimal nx_forward_struct_layout_probe1790017840 compiles but emits literal zero and fails0/1; same573B fixture with struct declared before reader nx_declared_struct_layout_probe1790017860 passes1/1. Retained witness buildroot/knowledge/gates/compiler-forward-struct-layout-witness.json. Owner compiler frontend/type-layout; PM coordinates. Require correct deferred layout or named compile refusal, not silent zero. Independent of private tail-frame repair; no serving compiler change.

On these two registers. Rows are declared in the domain's plan file and carry the debt id, which is the join key back to the sovereign debt plane — that plane, not this page, is the authority on state. Reconciling them automatically (the regen reading the plane and refreshing these rows) is a named, owed rung; until it lands, treat an id here as a pointer to look up, not a status to trust.

Honest verdict. Measured 2026-08-17 (local, no NAS load): a full gate build is 80-90ms -- the compiler is NOT the bottleneck. But it compiles whole-program with NO separate compilation and NO content-addressed cache, so most of every build re-emits an unchanged closure. Dead-code elimination LANDED 2026-08-18 (opt_module_dce_mark; re-keyed on this board 2026-08-23): measured on the live toolchain a trivial main now emits 976 asm lines / 10 functions instead of the whole 4,311-line syscall closure. The felt "slow and expensive" on the NAS is box contention + /api/build orchestration + bursting parallel builds, amplified by that redundancy. Genuine EXCEEDs: deterministic reproducible content-hashed builds by construction, and never-brick-the-builder guards in the lane. Industry beats us on build ENGINEERING (Go sub-second builds, Rust/Zig incremental, ccache/Bazel caches) but not determinism or sovereignty. Roadmap closes it safest-first: DCE, then a content cache (closure_sha256 already computed), then separate compilation, then a parallel scheduler.

Person · product · place — not yet measured for this domain

Every compare carries this layer. Declare knowledge/compare/toolchain.ppp (rows surface|nishi or c1..c4|label|url|connect naming OUR live surface and each rival's front door), run nx_ppp_probe domain toolchain, and this section fills itself on the next beat: the same ruler on both sides — privacy and CX (third-party hosts, tracker classes, cookies, security headers), design and longevity (design hygiene, computed WCAG contrast, render-blocking resources, unsized media, script weight, theme and motion queries), findability (landmarks, skip link, on-site search, breadcrumb, headings, internal links).

The field — discovered, not chosen

Rows written by nx_field_discover from toolchain.seeds: the industry's own lists (Wikipedia wikitext, GitHub topics, awesome lists) read mechanically, every candidate counted across seeds. The matrix columns above are a SEAT'S pick; this band is the population they were picked from, and the stats line measures one against the other. A rival here is a lead, never a verdict — it earns a column when its capabilities are read and pinned.

Discovery receipt. One row per counter the run wrote, in the receipt's own order; the rival rows follow in their own table.

Field discovery, counted
Class	Count	Note
seeds	3
scanned	3
fetched	3
reused	0
failed	0
named	3
candidates	3
mentions	3
capped	0

Rank	Rival	Seeds	Mentions	First seed	Kind	Link
1	Clang/LLVM	1	1	col0-clang	named	https://clang.llvm.org/docs/ThinLTO.html
2	Rust/Cargo	1	1	col2-rust	named	https://rustc-dev-guide.rust-lang.org/queries/incremental-compilation.html
3	Zig	1	1	col3-zig	named	https://ziglang.org/download/0.14.0/release-notes.html

Exclusive and shared capabilities

One capability is graded on one board; every other board references it. The fleet duplicate census (nx_rivalcensus dupes, on the fleetdupes clock row) reads every board's matrix and names each capability graded as a row on two or more boards, with a home derived from evidence: rung when exactly one board's plan contracts the symbol (that board is starred), gates when no plan contracts it and exactly one board's executed gate map runs the organ's gate (that board is plussed), ambiguous when several boards carry the deciding evidence (a decision for their seats), and none when no evidence decides it, with the reason beside it: unmapped (no board of the duplicate declares a gates map; declare the maps) or unproven (a map exists and runs none of the organ's gates; gate the organ on its proving board, or declare it a shared library by policy). A home elsewhere means this board should carry an @xrow reference to the home board's row rather than a graded row of its own; a home here means the other boards should. The table is this board's slice of one estate-wide census: the shape is shared, the rows are the board's.

This board grades 11 capabilities: 11 exclusive to it and 0 shared with other boards. Shared rows on this page: 0 = home here 0 + home elsewhere 0 + ambiguous 0 + undecided 0 + refused 0 (partition 0); undecided = unmapped 0 + unproven 0 + unevidenced 0; homonyms 0; since the previous census: new 0, resolved 0. Census FRESH age_s=6587.

Gaps from the record — what the estate does that no board carries

The record census (nx_goalmap record) reads the invoked-tool population and every plan queue row and files each organ or directive that NO matrix, plan or gates row names. A row here is a callout the boards missed: adjudicate it onto a board or declare it infrastructure. Census state STALE (age 1395692 s), sources read 4 of 7 declared — a BLIND census is a FLOOR: unread sources can only add rows.

kind	name	board	source	evidence

rows shown 0|this board's directives 0|estate-wide un-boarded organs 452 (listed in full on /compare/ecosystem)|census rows 639|malformed 0 (counted, never rendered)

References

Beyond a link list. Every reference below resolves twice — the publisher's copy and, where banked, the estate's own non-rottable library mirror with a content pin — and carries its evidence class plus the exact claim on this page it grounds. Keyed marks like [key] in the matrix notes jump here. A dash means honestly absent, never assumed.

[llvm-thinlto] LLVM Project. ThinLTO -- Clang documentation: scalable and incremental link-time optimization with a thin summary-based whole-program step and parallel backends. publisher · read in our library knowledge/fetched/cmp_toolchain_llvm-thinlto.html · pin h0b5cc7794c42e7caa2d8b94a2eb88df4f7841afee307e9e20eac478dd7c88a4f · accessed 2026-08-18 · vendor-docGrounds: The Clang/LLVM column and the "LIVE: Whole-program compilation (cross-module inlining possible)" row: LLVM ThinLTO is the named optimizing reference for cross-module visibility; ours is whole-program by default (one .s per target) without the incremental part.
[go-build-cache] The Go Programming Language. Go 1.10 Release Notes, Build and Install: the go command maintains a content-keyed build cache and detects out-of-date packages from source content and build flags, never modification times. publisher · read in our library knowledge/fetched/cmp_toolchain_go-build-cache.html · pin hebcefe0dfc2d09e662f5b37d4a308bd027c8f379659bf6ee531a71eda487e3e2 · accessed 2026-08-18 · vendor-docGrounds: The Go column across the "GAP: Content-addressed build cache (never rebuild identical)", "GAP: Incremental compilation (recompile only changed)" and "GAP: Separate compilation (per-module cached objects)" rows: Go packages compile once into a content-keyed cache, the sub-second-build bar the verdict names.
[rustc-incremental] Rust Compiler Development Guide: Incremental compilation -- the query system's red-green algorithm reuses unchanged query results across compilations. publisher · read in our library knowledge/fetched/cmp_toolchain_rustc-incremental.html · pin h4b2809b4691b1eac5f4e4b0f1512a99c267efe7d38f2058231b6bc108838c74a · accessed 2026-08-18 · vendor-docGrounds: The Rust/Cargo column on the "GAP: Incremental compilation (recompile only changed)" row (graded 2): rustc's red-green incremental scheme is the mechanism behind that code; ours rebuilds whole-program every time.
[zig-incremental] Zig Software Foundation. Zig 0.14.0 Release Notes: in-place incremental compilation (-fincremental) with file-system watching, compile-error feedback in tens of milliseconds on a large codebase; not yet on by default. publisher · read in our library knowledge/fetched/cmp_toolchain_zig-incremental.html · pin h67cb7a516762feaa8462e0a8184cad5a3668be723534ddfa28310f8b8be1d2d6 · accessed 2026-08-18 · vendor-docGrounds: The Zig column and the toolchain.plan bar "Zig incremental compiler (2026)": the self-hosted in-place incremental recompilation that bar names as the speed frontier, quoted from the vendor's own release notes rather than assumed.
[bazel-remote-cache] Bazel documentation: Remote Caching -- an action cache keyed by action hash plus a content-addressable store (CAS) of outputs, shareable across a fleet. publisher · read in our library knowledge/fetched/cmp_toolchain_bazel-remote-cache.html · pin h78f41f753b39b22b4192cc6b7b8576e881dbe61c0986b385eb8eee6e299d0fc3 · accessed 2026-08-18 · vendor-docGrounds: The toolchain.plan bar "Bazel / ccache content-addressed cache" and the "GAP: Remote / distributed build cache + farm" row: action-hash keys over a CAS is exactly the shape rung B2 (local) and B5 (remote) declare, with the byte-verified-on-hit tooth the risk row demands.
[ccache-manual] ccache(1) manual: a compiler cache that hashes the preprocessed input, compiler and options into a key and re-serves the cached object on a hit. publisher · read in our library knowledge/fetched/cmp_toolchain_ccache-manual.html · pin h1d9849cd84ed5dfbd2f218c86c9a7fb8346fccd7147425029166b64aedfe19d0 · accessed 2026-08-18 · vendor-docGrounds: The "GAP: Content-addressed build cache (never rebuild identical)" row names ccache/Bazel as the reference: this manual is the single-host form of that cache, the analogue of rung B2 keyed on (src + closure + toolchain hash).
[ld-gc-sections] GNU Binutils. ld Options: --gc-sections enables garbage collection of unused input sections at link time. publisher · read in our library knowledge/fetched/cmp_toolchain_ld-gc-sections.html · pin h0f235ad961de9aaddadb042818b2187f3b6c17960631d0c86c4f27d18c79f136 · accessed 2026-08-18 · vendor-docGrounds: The "GAP: Dead-code elimination (emit only reachable functions)" row states that --gc-sections is standard: this is the option's own documentation, the linker-level analogue of rung B1's reachability mark-sweep from main.
[reproducible-builds] Reproducible Builds project. Definitions: a build is reproducible if, given the same source, build environment and instructions, any party can recreate bit-by-bit identical artifacts, verified by cryptographic hash comparison. publisher · read in our library knowledge/fetched/cmp_toolchain_reproducible-builds.html · pin h67c75382073160d9cb1253b6991c361eab77309b29f7d2e9f1a6bb91e253eff0 · accessed 2026-08-18 · published-standardGrounds: The "LIVE: Deterministic reproducible build (bit-exact, content-hashed)" EXCEED row: this is the industry definition the row says is an ASK elsewhere and by construction here (integer codegen + closure_sha256, byte-identical rebuild proves a refactor neutral).
[ninja-manual] Ninja build system manual: builds always run in parallel, by default one job per CPU, designed for instant incremental builds on very large projects. publisher · read in our library knowledge/fetched/cmp_toolchain_ninja-manual.html · pin hc129b074c5c574d16fd959822eb51e9adba3d5fa25249c91175b555e4f7d7b5b · accessed 2026-08-18 · vendor-docGrounds: The "GAP: Parallel build scheduler (beyond the load throttle)" row and rung B4: the field runs the build DAG across cores by default; ours serializes under a BUILD-ADMIT load gate, which is why a 35-build burst hit load 20.

generated by nx_swcompare_matrix (sovereign NishiLang organ) from knowledge/compare/toolchain.matrix · source checks show implementation presence; runtime and user-outcome evidence are reported separately · JavaScript supports page controls