From 25ec7d360a3cf4fa1ee46fec99cbc1f6de8beb7c Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Tue, 22 Sep 2026 02:04:40 +0000 Subject: [PATCH 1/9] Regenerate the std_measure stage0 mirror, drifted since #11992 MIRROR-ONLY. No .dag authority changes; this is the projection catching up to one that already landed. 132c780e4a6 (#11992, the grain-parameterised rounder) landed its .dag without regenerating src/v1/stage0/src/std_measure.rs, so `claim_executor --required-regen` has been reporting drift on that path for every lane that runs it, unrelated to whatever that lane is changing. Two independent sessions hit it and had to establish it was not theirs before continuing. The diff is exactly the surface #11992 added -- GrainRounding, round_up_to_grain, gibibyte_grain, and the std_checked_arithmetic imports they need -- and is a pure addition: 46 inserted lines, none removed. Regenerated rather than hand-written. Safe to carry on a main base: the module contains no native FreeMonoid match (zero `__fm` occurrences), so the emitter that produced these bytes cannot have influenced them. Co-Authored-By: Claude Opus 5 (1M context) --- src/v1/stage0/src/std_measure.rs | 46 ++++++++++++++++++++++++++++++++ 1 file changed, 46 insertions(+) diff --git a/src/v1/stage0/src/std_measure.rs b/src/v1/stage0/src/std_measure.rs index 3a227d5a396..38f29fd46c2 100644 --- a/src/v1/stage0/src/std_measure.rs +++ b/src/v1/stage0/src/std_measure.rs @@ -4,6 +4,7 @@ use self::ClockBasis::*; use self::ClockDomain::*; use self::FiniteByteSizeBuild::*; +use self::GrainRounding::*; use self::InstantOrder::*; use self::MeasureSubtraction::*; use self::PositiveCelsiusDelta::*; @@ -28,6 +29,12 @@ pub use crate::extdeps_units_iso_80000_3::{ degrees_per_turn, square_millimetres_per_square_metre, }; pub use crate::std_algebra::FieldOfFractions; +pub use crate::std_checked_arithmetic::int_inclusive_max; +use crate::std_checked_arithmetic::CheckedIntOperands::BinaryOperands; +use crate::std_checked_arithmetic::IntegerArithmeticOperation::IntegerAdd; +pub use crate::std_checked_arithmetic::{ + CheckedIntOperands, IntegerArithmeticOperation, IntegerOverflow, +}; pub use crate::std_decl_ref::DeclarationRef; pub use crate::std_dissolution::unbound_dissolution; pub use crate::std_dissolution::DissolutionCondition; @@ -749,6 +756,45 @@ pub fn finite_byte_size_from_byte_size(size: ByteSize) -> Rc FiniteByteSize { + finite_byte_size(positive_measure_count((gibibyte_scale_factor_bytes() - 1))) +} + +#[derive(Debug, Clone, PartialEq, serde::Serialize, serde::Deserialize)] +#[serde(tag = "_variant")] +pub enum GrainRounding { + GrainRounded { bytes: ByteSize }, + GrainUnrepresentable { cause: Rc }, +} + +pub fn round_up_to_grain(bytes: ByteSize, grain: FiniteByteSize) -> Rc { + { + let n = byte_size_count(bytes.clone()); + let g = finite_byte_size_count(grain.clone()); + let remainder = (n.clone() % g.clone()); + let pad = if (remainder.clone() == 0) { + 0 + } else { + (g.clone() - remainder.clone()) + }; + if (n.clone() > (crate::std_checked_arithmetic::int_inclusive_max() - pad.clone())) { + Rc::new(GrainRounding::GrainUnrepresentable { + cause: Rc::new(IntegerOverflow { + operation: IntegerArithmeticOperation::IntegerAdd, + operands: Rc::new(CheckedIntOperands::BinaryOperands { + lhs: n.clone(), + rhs: pad.clone(), + }), + }), + }) + } else { + Rc::new(GrainRounding::GrainRounded { + bytes: byte_size((n.clone() + pad.clone())), + }) + } + } +} + pub fn watt(count: Nat) -> Watt { Rc::new(Measure { count: count.clone(), From 011ad7fc820b9b4a8810d604dda5f0772b82817c Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Mon, 21 Sep 2026 18:27:56 +0000 Subject: [PATCH 2/9] The lane's whole-corpus discovery fold was paid twice per adjudicate run; carry the value MEASURED ON THE FIRST NATIVE RUN OF A SELECTED PATTERN, 2026-09-21. Seven identities of v2.test.parse.expression_bodied_fn_decl_parse at //v2/test/parse/...:all, against the emitted closure of src/v2/compiler/00_compile.dag. The lane's own [native-cost-partition] receipt: TOTAL WALL 121.4 s context 97.88 s 80.6% parse+normalize, closure_reads 133 universe_derivation 23.35 s 19.2% corpus_reads 6482 load 0.11 s prepare 0.00 s eval 0.00 s universe_derivation is the phase the PATTERN DOES NOT NARROW -- 6482 corpus reads against 133 closure reads -- and it was being entered twice per run. The rendered adjudicate main binds `source_facts` and consumes it four times: native_lane_closure_modules, native_lane_closure_ingest, native_lane_ingest_receipt, native_lane_ingest_matches_closure. It then called the ingest-taking universe entry, whose first line derived THE SAME FOLD AGAIN from the same ingest. Per read that fold splits the file into lines, scans for the module header, scans for imports, scans for the first malformed import, and runs discover_floor_rows_for_source -- over every source, because discovery is corpus-wide by design and its refusals must hold outside any selection. Being corpus-wide is what makes paying twice expensive rather than untidy. DESIGN section 2: two demands for one semantic fact whose least common ancestor is ONE LINE above is authored duplication, and the repair is to carry the first value, never to make the second request cheap. The split is where the value already was -- the body took `facts` after its first line -- so native_lane_universe_of_facts IS that body. The PATTERN is threaded rather than defaulted, so the entry the main calls is the one a narrower pattern reaches: when the argv operand lands, that call site changes its pattern argument and nothing else. `native_lane_universe` leaves the emitted main's use-list because the main no longer calls it; under RUSTFLAGS=-D warnings an unused import is a build failure. CONTROLS, EXECUTED (gunbc run --claim-run over the witness file): reconciled 15/15 PASS, exit 0 mutated the facts-taking entry's malformed-import check bypassed: 4 FAIL, 2 accepted-path controls PASS, exit 1 A WITNESS SHAPE WAS WRITTEN AND DELETED RATHER THAN SHIPPED. Pairing the two entries and asserting they agree reads like an equivalence control and is a decoration: after the split native_lane_universe_selected(ingest, p) IS native_lane_universe_of_facts(native_lane_source_facts(ingest), p), so the comparison is an expression against itself. The mutation confirms it -- it moves BOTH sides. The arms assert the facts-taking entry directly instead. NATIVE VERIFICATION PENDING: whether the rendered main passes the facts it already bound is a property of emitted Rust and needs a build from this tree. Co-Authored-By: Claude Opus 5 (1M context) --- ...ative_lane_import_refusal_witness_test.dag | 58 ++++++++++++++++++- src/v1/05_emit_rust.dag | 11 +++- src/v2/compiler/00_compile.dag | 36 +++++++++++- 3 files changed, 99 insertions(+), 6 deletions(-) diff --git a/dag/test/claim/native_lane_import_refusal_witness_test.dag b/dag/test/claim/native_lane_import_refusal_witness_test.dag index c97756c1d13..98c4a3fbd4a 100644 --- a/dag/test/claim/native_lane_import_refusal_witness_test.dag +++ b/dag/test/claim/native_lane_import_refusal_witness_test.dag @@ -1,6 +1,9 @@ module test.claim.native_lane_import_refusal -import v2.compiler.compile { native_lane_universe, native_lane_universe_selected } +import v2.compiler.compile { + native_lane_source_facts, native_lane_universe, native_lane_universe_of_facts, + native_lane_universe_selected +} import extdeps.bazel.target_pattern { TargetPatternParsed, TargetPatternRefused, parse_target_pattern } @@ -15,7 +18,7 @@ import v2.std.integer { Int } import v2.std.algebra { any, contains, fold_list, length, list_snoc_item } import v2.std.collection { List } import v2.std.compilers.lexing { symbol_intern_lexeme, symbol_lexeme } -import gunbc.witness_v2_native_route { native_route_identity_qualified } +import gunbc.witness_v2_native_route { native_route_default_pattern, native_route_identity_qualified } data live_tree_disposition: LiveTreeDisposition = SubstrateInputsOnly @@ -366,4 +369,55 @@ test fn a_single_target_naming_a_module_refuses_with_the_module_spelling() -> Bo test fn the_suggested_module_spelling_selects_the_module() -> Bool { selected_admits(ingest: selection_combined_ingest, text: "//v2/test/selection_probe:all", qualified: "v2.test.selection_probe.probe_one") && selected_admits(ingest: selection_combined_ingest, text: "//v2/test/selection_probe:all", qualified: "v2.test.selection_probe.probe_two") +// ── the facts-taking entry carries every refusal ────────────────────────────────────────────── +// +// WHAT THESE ARMS ESTABLISH, AND THE ARM SHAPE THEY DELIBERATELY DO NOT USE. The lane's rendered +// main binds `source_facts` for the closure derivation and then derived the universe from the +// INGEST again, re-running the whole-corpus discovery fold it already held. The repair splits the +// producer so the main hands in the facts it holds. +// +// THE OBVIOUS WITNESS FOR THAT IS A DECORATION, AND IT WAS WRITTEN AND DELETED HERE RATHER THAN +// SHIPPED. Pairing the two entries over one fixture and asserting they agree reads like a strong +// equivalence control. It is not one: after the split `native_lane_universe_selected(ingest, p)` IS +// `native_lane_universe_of_facts(native_lane_source_facts(ingest), p)`, so the comparison is an +// expression against itself -- permanently green by construction. A mutation dropping a refusal +// from the shared body moves BOTH sides and the agreement still holds. DESIGN section 4b calls that +// worse than absent, because it is cited as coverage. (Measured: bypassing the malformed-import +// check failed four arms here and left the two accepted-path controls green.) +// +// So these arms assert the FACTS-TAKING ENTRY DIRECTLY, over facts derived by a separate call and +// handed in -- coverage that did not exist before, since nothing invoked that body with externally +// supplied facts. The three fixtures cover both refusal causes and the accepted path rather than +// three files; an arm over the accepted path alone would stay green if the entry refused nothing. +// +// WHAT THEY CANNOT REACH, said so the set is not over-read: whether the RENDERED MAIN passes the +// facts it already bound rather than re-deriving them. That is a property of emitted Rust, so no +// `.dag` arm holds it; its evidence is a native build. + +fn carried_at_default(ingest: SourceRootIngest) -> Bool { + match native_lane_universe_of_facts( + facts: native_lane_source_facts(ingest: ingest), + pattern: native_route_default_pattern() + ) { + Rejected { diagnostics: d } => d.head.reason == ^native_lane_import_line_names_no_module + Accepted { value: _, diagnostics: _ } => false + } +} + +test fn the_facts_taking_entry_admits_the_well_formed_source() -> Bool { + match native_lane_universe_of_facts( + facts: native_lane_source_facts(ingest: well_formed_import_ingest), + pattern: native_route_default_pattern() + ) { + Accepted { value: _, diagnostics: _ } => true + Rejected { diagnostics: _ } => false + } +} + +test fn the_facts_taking_entry_keeps_the_malformed_import_refusal() -> Bool { + carried_at_default(ingest: malformed_import_ingest) +} + +test fn the_facts_taking_entry_keeps_the_bare_import_refusal() -> Bool { + carried_at_default(ingest: bare_import_ingest) } diff --git a/src/v1/05_emit_rust.dag b/src/v1/05_emit_rust.dag index 5a26cb5ab7a..20ad93326d0 100644 --- a/src/v1/05_emit_rust.dag +++ b/src/v1/05_emit_rust.dag @@ -17116,7 +17116,7 @@ fn emit_source_root_eval_driver_main_rs(crate_name: String, pipeline_module: Str " native_lane_module_resolution,", "\n", " native_lane_closure_ingest, native_lane_closure_modules, native_lane_closure_round_budget,", "\n", " native_lane_ingest_matches_closure, native_lane_ingest_receipt, native_lane_receipt,", "\n", - " native_lane_source_facts, native_lane_universe_selected, native_test_context_absorb,", "\n", + " native_lane_source_facts, native_lane_universe_of_facts, native_test_context_absorb,", "\n", " native_test_context_finish, native_test_context_from_ingest, native_test_context_state_empty,", "\n", " native_test_front_end_prepare,", "\n", " native_driver_parse, native_driver_plan_exit, native_driver_plan_source_roots,", "\n", @@ -17133,7 +17133,7 @@ fn emit_source_root_eval_driver_main_rs(crate_name: String, pipeline_module: Str "\};", "\n", "use ", crate_name, "::gunbc_witness_v2_native_route::\{", "\n", " native_route_admission, native_route_admission_summary, native_route_admitted,", "\n", - " native_route_file_refusal_tally, native_route_member_row_text,", "\n", + " native_route_default_pattern, native_route_file_refusal_tally, native_route_member_row_text,", "\n", "\};", "\n", "use ", crate_name, "::v2_compiler_native_test_vocabulary::NativeTestVerdict;", "\n", "use ", crate_name, "::v2_compiler_source_authority::\{source_root_for_storage_path, DagSourceReadWitness\};", "\n", @@ -17510,7 +17510,12 @@ fn emit_source_root_eval_driver_main_rs(crate_name: String, pipeline_module: Str " // import closure of the universe's modules, which is all the front end is given.", "\n", " let universe_started = Instant::now();", "\n", " let source_facts = native_lane_source_facts(ingest.clone());", "\n", - " let universe = match &*native_lane_universe_selected(ingest.clone(), pattern.clone()) \{", "\n", + " // The universe is derived FROM THE FACTS ALREADY BOUND, not from the ingest again:", "\n", + " // the ingest-taking entry would re-run the whole-corpus discovery fold the line above", "\n", + " // just paid for, and that fold is the phase the pattern does NOT narrow. See", "\n", + " // v2.compiler.compile native_lane_universe_of_facts -- the pattern is threaded, so this", "\n", + " // is the same entry a narrower pattern reaches, never a filter over a default universe.", "\n", + " let universe = match &*native_lane_universe_of_facts(source_facts.clone(), pattern.clone()) \{", "\n", " Outcome::Accepted \{ value, .. \} => value.clone(),", "\n", " Outcome::Rejected \{ diagnostics \} => \{", "\n", " eprintln!(\"DERIVATION-REFUSED: \{diagnostics:#?\}\");", "\n", diff --git a/src/v2/compiler/00_compile.dag b/src/v2/compiler/00_compile.dag index d7a6117f8d0..d21d0b5c211 100644 --- a/src/v2/compiler/00_compile.dag +++ b/src/v2/compiler/00_compile.dag @@ -2170,8 +2170,42 @@ fn native_lane_universe(ingest: SourceRootIngest) -> Outcome // main calls; a caller naming a narrower pattern gets a narrower population through the same // producer -- never a filter applied to the default universe after the fact, so a corpus refusal // outside the pattern still refuses (a narrower question does not make a broken corpus sound). +// THE SOURCE FACTS ARE DERIVED ONCE AND CARRIED, BECAUSE THE LANE'S MAIN ALREADY HOLDS THEM. +// +// `native_lane_source_facts` is a fold over the WHOLE ingest that, per read, splits the file into +// lines, scans for the module header, scans for imports, scans for the first malformed import, and +// runs `discover_floor_rows_for_source`. It is corpus-wide BY DESIGN -- discovery is a corpus-wide +// question and its refusals must hold outside any selection -- which is exactly what makes paying +// for it twice expensive rather than merely untidy. +// +// MEASURED, on the first native run of a selected pattern (2026-09-21, seven identities of +// `v2.test.parse.expression_bodied_fn_decl_parse` at `//v2/test/parse/...:all`): the lane's own +// `[native-cost-partition]` receipt reports `universe_derivation` at 23.35 s of a 121.4 s wall, +// over `corpus_reads` 6482 while `closure_reads` was 133. So this is the phase that does NOT +// narrow with the pattern, and it was being entered twice per run. +// +// The rendered adjudicate main binds `source_facts` for the closure derivation -- +// `native_lane_closure_modules`, `native_lane_closure_ingest`, `native_lane_ingest_receipt` and +// `native_lane_ingest_matches_closure` all consume it -- and then called the universe producer, +// which opened by deriving the same fold again from the same ingest. Two identical folds over one +// corpus, in one process, with a shared-state least common ancestor ONE LINE above: DESIGN +// section 2's authored duplication, where the repetition is evidence about the demand graph rather +// than a caching obligation, and the repair is to carry the first value rather than to make the +// second request cheap. +// +// THE SPLIT IS WHERE THE VALUE ALREADY WAS. The body took `facts` after its first line, so +// `native_lane_universe_of_facts` IS that body and this stays the ingest-taking entry for callers +// that do not already hold the facts. The PATTERN is threaded rather than defaulted, so the entry +// the main calls is the same one a caller naming a narrower pattern reaches -- when the argv +// operand lands, that call site changes its pattern argument and nothing else. fn native_lane_universe_selected(ingest: SourceRootIngest, pattern: TargetPattern) -> Outcome { - let facts = native_lane_source_facts(ingest: ingest) + native_lane_universe_of_facts(facts: native_lane_source_facts(ingest: ingest), pattern: pattern) +} + +fn native_lane_universe_of_facts( + facts: List, + pattern: TargetPattern +) -> Outcome { match native_lane_malformed_import_row(facts: facts) { Present { value: f } => native_lane_refused( From cb7bfd608b7e1b901fa1d130eccc7557a041d61b Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Mon, 21 Sep 2026 19:38:23 +0000 Subject: [PATCH 3/9] Walk discovery where it is consulted: a focused gunbc test stops paying for repository hygiene discover_floor_rows_for_source is the expensive half of native_lane_source_facts -- a walk of the file's whole content producing rows, sidecar violations and dispositions, against three line scans for the other three fields. It ran for every read. Its three consumers, read one at a time: 1. native_lane_label_universe reads f.discovery.rows INSIDE its own `if !native_route_universe_member(module_qn: declared) { acc }` guard, so a non-member never reaches it; 2. native_lane_unowned_row_path reads the row count only in its `f.module` Absent arm -- a file that declares no module yet enrolled rows; 3. floor_discovery_finalize_source_outcomes folds EVERY state and refuses on walk failures, disposition refusals and sidecar violations ANYWHERE in the corpus. Only (3) wants the corpus, and (3) is REPOSITORY HYGIENE rather than this lane's question. Whether some unrelated module places a sidecar correctly is not part of "are the requested tests complete". MEASURED: universe members are 935 of 6484 corpus files (14.4%), so (1) consulted one file in seven while all seven were walked. THE GUARANTEE IS PRESERVED AT ITS PROPER CONSUMER, WHICH IS WHY THIS IS DE-DUPLICATION AND NOT A RUNG DROP. The required floor runs this same producer independently over its own prepared sources and adjudicates the same finalize -- required_floor_runner reaches it through parse_floor_discovery_producer_result. The corpus-wide refusal still exists and still blocks a landing; what is removed is a SECOND authority asserting it from a consumer whose subject is a selected test population. WHAT IS DELIBERATELY KEPT CORPUS-WIDE: the import scans. malformed_import and imports protect THIS LANE'S OWN COMPLETENESS -- a malformed import line in any module the closure walk reaches would silently NARROW the closure, which is the arm this witness file exists to refuse, and the closure can reach any module rather than only universe members. Selected-test completeness is kept; repository hygiene is handed back. CONTROLS, EXECUTED: scoped 17/17 PASS, exit 0 mutated scoping removed (every file walked again): EXACTLY ONE arm fails, a_universe_member_is_walked_and_an_outsider_is_not, 16 PASS, exit 1 The new arm is what makes the scoping OBSERVABLE rather than asserted: the refusal arms check what the derivation ANSWERS, and scoping changes what it SPENDS, so both fixtures are accepted either way and a verdict-only set would stay green if the walk returned. Two reads differing in one thing -- `v2.test.` versus `v2.testing.` -- with rows on the inside and none on the outside is the scoping itself. A module-less read keeps its walk, because the unowned-row refusal reads exactly those rows. Co-Authored-By: Claude Opus 5 (1M context) --- ...ative_lane_import_refusal_witness_test.dag | 54 +++++++++++++++ src/v1/05_emit_rust.dag | 2 +- src/v2/compiler/00_compile.dag | 66 +++++++++++++++++-- 3 files changed, 115 insertions(+), 7 deletions(-) diff --git a/dag/test/claim/native_lane_import_refusal_witness_test.dag b/dag/test/claim/native_lane_import_refusal_witness_test.dag index 98c4a3fbd4a..dfb97f845af 100644 --- a/dag/test/claim/native_lane_import_refusal_witness_test.dag +++ b/dag/test/claim/native_lane_import_refusal_witness_test.dag @@ -421,3 +421,57 @@ test fn the_facts_taking_entry_keeps_the_malformed_import_refusal() -> Bool { test fn the_facts_taking_entry_keeps_the_bare_import_refusal() -> Bool { carried_at_default(ingest: bare_import_ingest) } + +// ── discovery is walked where it is consulted, and nowhere else ──────────────────────────────── +// +// THE ARM THAT MAKES THE SCOPING OBSERVABLE RATHER THAN ASSERTED. The refusal arms above cannot +// see it: they check what the derivation ANSWERS, and scoping discovery changes what it SPENDS. +// Both fixtures are accepted either way, so a set that only read verdicts would stay green if the +// walk were restored to every file. +// +// The two reads differ in ONE thing -- the declared namespace, `v2.test.` versus `v2.testing.` -- +// and both carry `test fn` declarations that discovery would enrol. So rows on the inside read and +// no rows on the outside read is the scoping itself, at the one place it is decidable: the outside +// module is never consulted by `native_lane_label_universe` (its own universe-member guard) nor by +// `native_lane_unowned_row_path` (it declares a module), and the corpus-wide finalize that was its +// only other reader is repository hygiene the required floor owns. +// +// REMOVING THE SCOPING TURNS THIS RED, which is what distinguishes it from a restatement of the +// fixtures: the outside read would enrol its declaration and the second assertion would fail. + +// A read with NO `module` header: the one shape whose discovery rows the unowned-row refusal +// reads, and therefore the one that must keep its walk regardless of membership. +data unowned_row_read: DagSourceReadWitness = DagSourceReadWitness { + source: Medium { + carried: "test fn orphan_probe() -> Bool { true }\n", + fidelity: Lossless + }, + artifact: Artifact { + kind: SourceFile, + id: ^unowned_row_artifact, + file_path: "src/v2/test/unowned_row_test.dag" + }, + compilation_unit: symbol_intern_lexeme(lexeme: "src/v2/test/unowned_row_test.dag"), + source_root: v2.std.cross_tree.import_model.V2Tree +} + +data unowned_row_ingest: SourceRootIngest = [unowned_row_read] + +fn discovery_row_count(ingest: SourceRootIngest) -> Int { + fold_list( + xs: native_lane_source_facts(ingest: ingest), + empty: 0, + cons: fn(acc, f) { acc + length(xs: f.discovery.rows) } + ) +} + +test fn a_universe_member_is_walked_and_an_outsider_is_not() -> Bool { + (discovery_row_count(ingest: selection_inside_ingest) == 2) + && (discovery_row_count(ingest: selection_outside_ingest) == 0) +} + +// A module-less file keeps its walk, because the unowned-row refusal reads exactly those rows -- +// scoping on membership must not reach the arm that has no membership to test. +test fn a_source_declaring_no_module_is_still_walked() -> Bool { + discovery_row_count(ingest: unowned_row_ingest) > 0 +} diff --git a/src/v1/05_emit_rust.dag b/src/v1/05_emit_rust.dag index 20ad93326d0..e1ad73ab8a0 100644 --- a/src/v1/05_emit_rust.dag +++ b/src/v1/05_emit_rust.dag @@ -17133,7 +17133,7 @@ fn emit_source_root_eval_driver_main_rs(crate_name: String, pipeline_module: Str "\};", "\n", "use ", crate_name, "::gunbc_witness_v2_native_route::\{", "\n", " native_route_admission, native_route_admission_summary, native_route_admitted,", "\n", - " native_route_default_pattern, native_route_file_refusal_tally, native_route_member_row_text,", "\n", + " native_route_file_refusal_tally, native_route_member_row_text,", "\n", "\};", "\n", "use ", crate_name, "::v2_compiler_native_test_vocabulary::NativeTestVerdict;", "\n", "use ", crate_name, "::v2_compiler_source_authority::\{source_root_for_storage_path, DagSourceReadWitness\};", "\n", diff --git a/src/v2/compiler/00_compile.dag b/src/v2/compiler/00_compile.dag index d21d0b5c211..ff1c4fd6c8a 100644 --- a/src/v2/compiler/00_compile.dag +++ b/src/v2/compiler/00_compile.dag @@ -24,7 +24,8 @@ import v2.workflow.floor_discovery_source_authority { FloorDiscoveryRefused, FloorDiscoveryWalkState, discover_floor_rows_for_source, - floor_discovery_finalize_source_outcomes + floor_discovery_finalize_source_outcomes, + floor_discovery_walk_state_zero } import v2.std.compilers.lexing { symbol_intern_lexeme, symbol_lexeme } import extdeps.bazel.label { Label, LabelParsed, LabelRefused, render_package } @@ -1780,20 +1781,73 @@ fn native_lane_source_facts(ingest: SourceRootIngest) -> List, + read: DagSourceReadWitness +) -> FloorDiscoveryWalkState { + match declared { + Absent => + discover_floor_rows_for_source( + repo_path: symbol_lexeme(sym: read.compilation_unit), + content: read.source.carried + ) + Present { value: qn } => + if native_route_universe_member(module_qn: qn) { + discover_floor_rows_for_source( + repo_path: symbol_lexeme(sym: read.compilation_unit), + content: read.source.carried + ) + } else { + floor_discovery_walk_state_zero() + } + } +} + // ONE UNIVERSE MEMBER'S MODULE: the identities discovery enrolled for it, and the path they were // read from. Declarations stay grouped by module because prepare (resolve + infer) is paid once // per module and every declaration of a module shares its outcome. From ae170ad5173be94920c36cbf49c50a055670fe66 Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Tue, 22 Sep 2026 01:17:12 +0000 Subject: [PATCH 4/9] The scoping is held by four refusal controls, and three notes stop claiming the behaviour it replaced Scoping discovery to the sources that consult it changed what this lane REFUSES, and the branch left the old guarantee asserted in three places. The finalize note said the per-source states are handed to floor_discovery_finalize_source_outcomes "untouched", and named filtering first as the thing that would make the lane blind to a sidecar violation outside `v2.test.*`. That is now precisely the behaviour: a non-member gets a zero state. The note now says what was given up, why it is a section 2 de-duplication rather than a section 4b rung drop -- required_floor_runner reaches the SAME floor_discovery_finalize_source_outcomes through parse_floor_discovery_producer_result, verified rather than asserted -- and which arms hold it. The selection_outside_read fixture note likewise said it "must DISCOVER cleanly"; it is a non-member and is no longer walked. the_out_of_selection_source_is_discovered_not_refused is renamed to the_out_of_selection_source_is_accepted_not_refused. The arm asserts acceptance; the old name claimed a walk that no longer happens, and would have been cited as coverage for it while staying green. FOUR CONTROLS, IN REFUSALS RATHER THAN ROW COUNTS. The existing pair observes what discovery SPENDS, and would stay green if the finalize were disarmed outright, because a disarmed finalize enrols the same rows. The new arms drive native_lane_universe end to end: a walked member's violation still refuses, a non-member's no longer does, the floor's own producer still refuses THAT SAME content read off the fixture, and a module-less source keeps its walk and still refuses. Three fixtures differing in one property -- the module header -- each carrying `test fn` at a non-`_test.dag` path, which is a real TestMarkedDecl violation through the real producer rather than a hand-built walk state. EVIDENCE. All six arms return true. Mutating native_lane_discovery_for to walk every source turns a_non_member_sidecar_violation_no_longer_refuses_the_lane red (returned `false`), so the narrowing arm discriminates and is not a decoration; the mutation is reverted. Co-Authored-By: Claude Opus 5 (1M context) --- ...ative_lane_import_refusal_witness_test.dag | 154 +++++++++++++++++- src/v2/compiler/00_compile.dag | 29 +++- 2 files changed, 168 insertions(+), 15 deletions(-) diff --git a/dag/test/claim/native_lane_import_refusal_witness_test.dag b/dag/test/claim/native_lane_import_refusal_witness_test.dag index dfb97f845af..7e5140fccd8 100644 --- a/dag/test/claim/native_lane_import_refusal_witness_test.dag +++ b/dag/test/claim/native_lane_import_refusal_witness_test.dag @@ -18,6 +18,12 @@ import v2.std.integer { Int } import v2.std.algebra { any, contains, fold_list, length, list_snoc_item } import v2.std.collection { List } import v2.std.compilers.lexing { symbol_intern_lexeme, symbol_lexeme } +import v2.workflow.floor_discovery_source_authority { + FloorDiscoveryAccepted, + FloorDiscoveryRefused, + discover_floor_rows_for_source, + floor_discovery_finalize_source_outcomes +} import gunbc.witness_v2_native_route { native_route_default_pattern, native_route_identity_qualified } data live_tree_disposition: LiveTreeDisposition = SubstrateInputsOnly @@ -124,9 +130,13 @@ data selection_inside_read: DagSourceReadWitness = DagSourceReadWitness { } // `v2.testing.` shares the character prefix `v2.test` and is NOT under the `v2.test.` namespace -- -// the case the selection separator exists to separate. It must DISCOVER cleanly and be excluded by -// selection alone; were it to refuse discovery, the whole derivation would refuse and this pair -// would prove nothing. +// the case the selection separator exists to separate. It must be excluded by SELECTION alone and +// must not refuse the derivation on its way there; were it to refuse, the whole derivation would +// refuse and this pair would prove nothing. +// +// It is also a universe NON-MEMBER, so discovery no longer walks it at all -- the row-count arm +// below reads that as zero enrolled rows, and the refusal arms further down read it as a sidecar +// violation this lane no longer raises. data selection_outside_read: DagSourceReadWitness = DagSourceReadWitness { source: Medium { carried: "module v2.testing.selection_probe\n\ntest fn probe_one() -> Bool { true }\n", @@ -234,12 +244,19 @@ fn universe_accepted(ingest: SourceRootIngest) -> Bool { } // THE CONTROL THAT MAKES THE EXCLUSION ATTRIBUTABLE, and it asserts ACCEPTANCE rather than a -// population. The derivation finalizes discovery over every supplied source BEFORE selection -// filters, so a malformed source refuses the whole thing -- meaning an excluded module and a -// broken one both yield no identity, and a population arm alone cannot tell them apart. This says -// the out-of-selection source is discovered fine; the arm below then attributes its absence from -// the combined ingest to selection and to nothing else. -test fn the_out_of_selection_source_is_discovered_not_refused() -> Bool { +// population. The derivation finalizes discovery BEFORE selection filters, so a source that +// refused discovery would refuse the whole thing -- meaning an excluded module and a broken one +// both yield no identity, and a population arm alone cannot tell them apart. This says the +// out-of-selection source is ACCEPTED and contributes no identity; the arm below then attributes +// its absence from the combined ingest to selection and to nothing else. +// +// THE NAME IS DELIBERATELY NOT `..._is_discovered_...`, which is what it was called until discovery +// was scoped to the sources that consult it. This source is a universe non-member, so it is no +// longer walked, and an arm whose name claims it was discovered would assert the opposite of what +// the code now does while staying green -- the stale-name defect, one rename ahead of a reader +// citing it as coverage for a walk that no longer happens. Acceptance is what this arm establishes +// and all it establishes. +test fn the_out_of_selection_source_is_accepted_not_refused() -> Bool { universe_accepted(ingest: selection_outside_ingest) && (length(xs: universe_qualified_names(ingest: selection_outside_ingest)) == 0) } @@ -475,3 +492,122 @@ test fn a_universe_member_is_walked_and_an_outsider_is_not() -> Bool { test fn a_source_declaring_no_module_is_still_walked() -> Bool { discovery_row_count(ingest: unowned_row_ingest) > 0 } + +// ── the scoping's boundary, read in REFUSALS rather than in row counts ───────────────────────── +// +// WHY THE ROW-COUNT PAIR ABOVE IS NOT ENOUGH. `a_universe_member_is_walked_and_an_outsider_is_not` +// observes what discovery SPENDS. It does not observe what the lane still REFUSES, and refusing is +// the guarantee the scoping actually moves: `floor_discovery_finalize_source_outcomes` refuses on a +// walk failure, a disposition refusal or a sidecar violation, and handing it a zero state for a +// non-member removes that source's ability to refuse. A set that counted rows alone would stay +// green if the finalize were disarmed outright, because a disarmed finalize still enrols the same +// rows. +// +// THE THREE FIXTURES DIFFER FROM EACH OTHER IN ONE PROPERTY, AND FROM THE ACCEPTED ONES IN ONE +// MORE. Each carries `test fn` at a path that does NOT end `_test.dag`, which is the +// `TestMarkedDecl` sidecar violation -- one real refusal cause, reached through the real producer, +// rather than a hand-built walk state. They then differ only in the module header: `v2.test.` +// (member, walked), `v2.testing.` (non-member, not walked), and none at all (no membership to +// test, so walked). Because the violation arm collects a violation INSTEAD of enrolling rows, the +// module-less fixture enrols nothing and therefore does not trip the unowned-row refusal on its +// way to the finalize -- which is what lets the fourth arm attribute its refusal to the finalize. +// +// THE SECOND ARM IS A NARROWING, AND IT IS STATED AS ONE. It asserts that this lane NO LONGER +// refuses a real corpus violation. On its own that reads as a safety regression, so the third arm +// is its pairing obligation discharged by execution: the floor's own producer, over THE SAME BYTES +// the lane declined to walk, still refuses. Without that arm the second is an unwitnessed loss. + +data member_violation_read: DagSourceReadWitness = DagSourceReadWitness { + source: Medium { + carried: "module v2.test.violation_probe\n\ntest fn probe_one() -> Bool { true }\n", + fidelity: Lossless + }, + artifact: Artifact { + kind: SourceFile, + id: ^member_violation_artifact, + file_path: "src/v2/test/violation_probe.dag" + }, + compilation_unit: symbol_intern_lexeme(lexeme: "src/v2/test/violation_probe.dag"), + source_root: v2.std.cross_tree.import_model.V2Tree +} + +data non_member_violation_read: DagSourceReadWitness = DagSourceReadWitness { + source: Medium { + carried: "module v2.testing.violation_probe\n\ntest fn probe_one() -> Bool { true }\n", + fidelity: Lossless + }, + artifact: Artifact { + kind: SourceFile, + id: ^non_member_violation_artifact, + file_path: "src/v2/testing/violation_probe.dag" + }, + compilation_unit: symbol_intern_lexeme(lexeme: "src/v2/testing/violation_probe.dag"), + source_root: v2.std.cross_tree.import_model.V2Tree +} + +data module_less_violation_read: DagSourceReadWitness = DagSourceReadWitness { + source: Medium { + carried: "test fn probe_one() -> Bool { true }\n", + fidelity: Lossless + }, + artifact: Artifact { + kind: SourceFile, + id: ^module_less_violation_artifact, + file_path: "src/v2/test/violation_orphan.dag" + }, + compilation_unit: symbol_intern_lexeme(lexeme: "src/v2/test/violation_orphan.dag"), + source_root: v2.std.cross_tree.import_model.V2Tree +} + +data member_violation_ingest: SourceRootIngest = [member_violation_read] +data non_member_violation_ingest: SourceRootIngest = [non_member_violation_read] +data module_less_violation_ingest: SourceRootIngest = [module_less_violation_read] + +// A WALKED MEMBER STILL REFUSES: the scoping narrowed which sources are walked, not what a walked +// source's violation does. This is the positive control the two narrowing arms are read against. +test fn a_universe_member_sidecar_violation_still_refuses_the_lane() -> Bool { + match native_lane_universe(ingest: member_violation_ingest) { + Rejected { diagnostics: d } => d.head.reason == ^native_lane_universe_derivation_refused + Accepted { value: _, diagnostics: _ } => false + } +} + +// THE NARROWING ITSELF, asserted rather than implied. Identical content and identical violation, +// one namespace segment away from the arm above. Restore the walk for non-members and this goes +// red -- which is what makes it the discriminating arm for the scoping and not a restatement of +// the row counts. +test fn a_non_member_sidecar_violation_no_longer_refuses_the_lane() -> Bool { + match native_lane_universe(ingest: non_member_violation_ingest) { + Accepted { value: _, diagnostics: _ } => true + Rejected { diagnostics: _ } => false + } +} + +// THE PRESERVED CONSUMER, OVER THE SAME BYTES. The required floor reaches this producer and this +// finalize independently of the lane, so the corpus refusal the arm above gave up still exists at +// its home. The content is READ OFF THE FIXTURE rather than restated, so the two arms cannot drift +// apart into agreeing about different sources. +test fn the_required_floor_producer_still_refuses_that_non_member_violation() -> Bool { + match floor_discovery_finalize_source_outcomes( + outcomes: [ + discover_floor_rows_for_source( + repo_path: symbol_lexeme(sym: non_member_violation_read.compilation_unit), + content: non_member_violation_read.source.carried + ) + ] + ) { + FloorDiscoveryRefused { reason: _ } => true + FloorDiscoveryAccepted { rows: _ } => false + } +} + +// A MODULE-LESS SOURCE HAS NO MEMBERSHIP TO TEST, so the scoping must not reach it. The row-count +// arm above establishes that such a file is still walked; this one establishes that its walk still +// REFUSES, which is the property the finalize consumer actually needs and the one a zero state +// would silently remove. +test fn a_module_less_sidecar_violation_still_refuses_the_lane() -> Bool { + match native_lane_universe(ingest: module_less_violation_ingest) { + Rejected { diagnostics: d } => d.head.reason == ^native_lane_universe_derivation_refused + Accepted { value: _, diagnostics: _ } => false + } +} diff --git a/src/v2/compiler/00_compile.dag b/src/v2/compiler/00_compile.dag index ff1c4fd6c8a..19198a78d73 100644 --- a/src/v2/compiler/00_compile.dag +++ b/src/v2/compiler/00_compile.dag @@ -2189,12 +2189,29 @@ fn native_lane_universe_module_for_source( } -// THE DERIVATION IS THE FLOOR'S OWN PRODUCER, FINALIZED THE FLOOR'S OWN WAY. The per-source -// states are handed to floor_discovery_finalize_source_outcomes untouched — so a walk failure, a -// disposition refusal or a sidecar violation ANYWHERE in the inventory refuses the derivation -// exactly as it refuses the required floor's — and only then are the universe-prefixed modules -// kept. Filtering first and finalizing the remainder would have made the lane blind to a sidecar -// violation outside `v2.test.*`, which is a corpus refusal, not a lane exclusion. +// THE DERIVATION FINALIZES THE FLOOR'S OWN PRODUCER, OVER THE SOURCES IT STILL WALKS. Every state +// this lane holds is handed to floor_discovery_finalize_source_outcomes unchanged, so a walk +// failure, a disposition refusal or a sidecar violation in a WALKED source refuses the derivation +// exactly as it refuses the required floor's, and only then are the universe-prefixed modules +// kept. +// +// WHAT CHANGED, SAID WHERE THE READER MEETS THE FINALIZE RATHER THAN ONLY AT THE SCOPING. The set +// of walked sources is no longer the whole inventory: native_lane_discovery_for substitutes a zero +// state for a universe non-member, so a sidecar violation in a module outside `v2.test.*` no +// longer refuses THIS lane. An earlier revision of this note named that exact narrowing as the +// thing to avoid. It is now the behaviour, and the argument for it is NOT that the violation +// stopped mattering -- it is that this lane was the SECOND authority asserting it. The required +// floor runs the same producer over its own prepared sources and adjudicates the same finalize +// (required_floor_runner, through parse_floor_discovery_producer_result), so the corpus refusal +// still exists and still blocks a landing. That is what makes this a de-duplication (DESIGN +// section 2, one fact one home) rather than a section 4b rung drop. +// +// THE NARROWING IS NOT TAKEN ON THIS NOTE'S WORD. Four arms in +// test.claim.native_lane_import_refusal pin it at the boundary, in refusals rather than row +// counts: a walked member's violation still refuses here, a non-member's no longer does, the +// floor's own producer still refuses THAT SAME non-member content, and a module-less source keeps +// its walk and still refuses. Restore the walk for non-members and the second goes red; disarm +// the finalize and the other three do. // A SOURCE THAT ENROLS ROWS AND DECLARES NO MODULE IS A REFUSAL, NOT A DROP. Discovery reads the // path and the bytes, so it can enrol test identities for a file whose own header names no module // — and such an identity cannot be routed, because the driver resolves by module. The seed refused From 98c0c05e2265926bc9ce37127bc6d2f206959c24 Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Tue, 22 Sep 2026 01:57:40 +0000 Subject: [PATCH 5/9] Review corrections: isolate the fixtures structurally, and stop the carried-facts note arguing for corpus-wide discovery FIXTURE ISOLATION (review item 1). The three specimens varied their PATH alongside their module header, and `compilation_unit` is what discovery receives as its entry path -- an operational input, not a label. A wrong implementation deciding membership from the path prefix satisfied every specimen. They are now built by ONE CONSTRUCTOR taking only the content, so the isolation is structural rather than a promise three hand-copied records keep, and all three sit at a path under `src/v2/test/`. The non-member therefore declares `module v2.testing.violation_probe` FROM A MEMBER-LOOKING PATH, which is the missing discriminator rather than a separate control. THE CARRIED-FACTS NOTE (review item 2) said "discovery is a corpus-wide question and its refusals must hold outside any selection", which is what this branch stops doing, and described a rendered main and a future argv operand that this branch already changed. It now carries the actual pipeline and states the boundary honestly: THE NATIVE-UNIVERSE BOUNDARY IS NOT THE SEVEN-TEST BOUNDARY -- discovery is scoped to `v2.test.*` membership, not to the requested pattern, so a run naming one package still walks every other native test module, and acquisition and the import scans remain broader. EVIDENCE LEVEL, corrected in both files rather than only in the PR. The 23.35 s is the OLD PHASE COST, not a saving demonstrated here. A successful native build proves COMPILATION, not that a second fold is gone; closing that needs the produced main and its call path read, with the runtime claim from the existing [native-cost-partition] observations. And the floor-preservation arm runs the PRODUCER AND FINALIZER themselves -- that `required_floor_runner` calls that same finalize is SOURCE INSPECTION, not a newly executed merge-blocking control. The preserved caller is read; the preserved computation is run. REBASED onto current main, absorbing the de-duplication so this is one head. The rebase collided with #12006, which had added two arms and the `symbol_lexeme` import to this same witness; both of its arms are byte- identical to main's copy here. EVIDENCE. All seven arms return true. Two mutations of `native_lane_discovery_for`, each run against a_non_member_sidecar_violation_no_longer_refuses_the_lane: - scoping removed, walk every source -> returned `false` - membership read from the PATH prefix -> returned `false` The second is the one the fixture repair exists for: under the previous fixtures that implementation stayed green. Both mutations reverted and the file diffed byte-identical afterwards. Co-Authored-By: Claude Opus 5 (1M context) --- ...ative_lane_import_refusal_witness_test.dag | 98 +++++++++++-------- src/v2/compiler/00_compile.dag | 40 ++++++-- 2 files changed, 88 insertions(+), 50 deletions(-) diff --git a/dag/test/claim/native_lane_import_refusal_witness_test.dag b/dag/test/claim/native_lane_import_refusal_witness_test.dag index 7e5140fccd8..ae835a3bffe 100644 --- a/dag/test/claim/native_lane_import_refusal_witness_test.dag +++ b/dag/test/claim/native_lane_import_refusal_witness_test.dag @@ -386,6 +386,8 @@ test fn a_single_target_naming_a_module_refuses_with_the_module_spelling() -> Bo test fn the_suggested_module_spelling_selects_the_module() -> Bool { selected_admits(ingest: selection_combined_ingest, text: "//v2/test/selection_probe:all", qualified: "v2.test.selection_probe.probe_one") && selected_admits(ingest: selection_combined_ingest, text: "//v2/test/selection_probe:all", qualified: "v2.test.selection_probe.probe_two") +} + // ── the facts-taking entry carries every refusal ────────────────────────────────────────────── // // WHAT THESE ARMS ESTABLISH, AND THE ARM SHAPE THEY DELIBERATELY DO NOT USE. The lane's rendered @@ -409,7 +411,10 @@ test fn the_suggested_module_spelling_selects_the_module() -> Bool { // // WHAT THEY CANNOT REACH, said so the set is not over-read: whether the RENDERED MAIN passes the // facts it already bound rather than re-deriving them. That is a property of emitted Rust, so no -// `.dag` arm holds it; its evidence is a native build. +// `.dag` arm holds it -- and a SUCCESSFUL NATIVE BUILD DOES NOT HOLD IT EITHER, because a build +// proves the emitted program compiles, not that a second fold is gone. Closing it means reading +// the produced main and its call path for the carried binding, with the runtime claim taken from +// the lane's existing `[native-cost-partition]` observations. fn carried_at_default(ingest: SourceRootIngest) -> Bool { match native_lane_universe_of_facts( @@ -514,50 +519,59 @@ test fn a_source_declaring_no_module_is_still_walked() -> Bool { // // THE SECOND ARM IS A NARROWING, AND IT IS STATED AS ONE. It asserts that this lane NO LONGER // refuses a real corpus violation. On its own that reads as a safety regression, so the third arm -// is its pairing obligation discharged by execution: the floor's own producer, over THE SAME BYTES -// the lane declined to walk, still refuses. Without that arm the second is an unwitnessed loss. - -data member_violation_read: DagSourceReadWitness = DagSourceReadWitness { - source: Medium { - carried: "module v2.test.violation_probe\n\ntest fn probe_one() -> Bool { true }\n", - fidelity: Lossless - }, - artifact: Artifact { - kind: SourceFile, - id: ^member_violation_artifact, - file_path: "src/v2/test/violation_probe.dag" - }, - compilation_unit: symbol_intern_lexeme(lexeme: "src/v2/test/violation_probe.dag"), - source_root: v2.std.cross_tree.import_model.V2Tree +// pairs it: the floor's own producer and finalize, over THE SAME BYTES the lane declined to walk, +// still refuse. Without that arm the second is an unwitnessed loss. +// +// BE EXACT ABOUT WHAT THAT THIRD ARM EXECUTES, because it is easy to claim more. It runs +// `discover_floor_rows_for_source` and `floor_discovery_finalize_source_outcomes` -- the producer +// and finalizer THEMSELVES. It does NOT run the host runner and does not demonstrate a failing CI +// exit. That `required_floor_runner` calls that same finalize, and surfaces its refusal as +// `REQUIRED-FLOOR REFUSAL cause=FloorDiscoveryRefused`, is established by SOURCE INSPECTION of the +// runner, not by a newly executed merge-blocking control. The preserved caller is read; the +// preserved computation is run. + +// ONE LOCATION, ONE ARTIFACT IDENTITY, ONE SOURCE ROOT -- the three specimens differ in their +// MODULE HEADER AND IN NOTHING ELSE. They are built by one constructor taking only the content, so +// the isolation is STRUCTURAL rather than a promise three hand-copied records keep. An earlier +// revision authored them separately and let the path vary with the namespace +// (`src/v2/test/...` against `src/v2/testing/...`), which is not a cosmetic difference here: +// `compilation_unit` is what discovery receives as its entry path, so it is an operational input. +// +// THE SHARED PATH IS THE DISCRIMINATOR, NOT MERELY TIDINESS. All three sit at a path under +// `src/v2/test/`, so the NON-MEMBER declares `module v2.testing.violation_probe` from a path whose +// prefix looks like a member's. An implementation that decided membership from the PATH rather than +// from the declared module would walk it, raise its violation, and turn +// `a_non_member_sidecar_violation_no_longer_refuses_the_lane` red. With the paths varying alongside +// the namespace, that wrong implementation satisfied every specimen. This is a missing +// discriminator closed, not a defect found in `native_route_universe_member`, which reads the +// declared module today. +// +// The path deliberately does NOT end `_test.dag`: that is what makes `test fn` in the content a +// `TestMarkedDecl` sidecar violation, which is the real refusal cause these arms are built on. +fn violation_read_for(content: String) -> DagSourceReadWitness { + DagSourceReadWitness { + source: Medium { carried: content, fidelity: Lossless }, + artifact: Artifact { + kind: SourceFile, + id: ^violation_probe_artifact, + file_path: "src/v2/test/violation_probe.dag" + }, + compilation_unit: symbol_intern_lexeme(lexeme: "src/v2/test/violation_probe.dag"), + source_root: v2.std.cross_tree.import_model.V2Tree + } } -data non_member_violation_read: DagSourceReadWitness = DagSourceReadWitness { - source: Medium { - carried: "module v2.testing.violation_probe\n\ntest fn probe_one() -> Bool { true }\n", - fidelity: Lossless - }, - artifact: Artifact { - kind: SourceFile, - id: ^non_member_violation_artifact, - file_path: "src/v2/testing/violation_probe.dag" - }, - compilation_unit: symbol_intern_lexeme(lexeme: "src/v2/testing/violation_probe.dag"), - source_root: v2.std.cross_tree.import_model.V2Tree -} +data member_violation_read: DagSourceReadWitness = violation_read_for( + content: "module v2.test.violation_probe\n\ntest fn probe_one() -> Bool { true }\n" +) -data module_less_violation_read: DagSourceReadWitness = DagSourceReadWitness { - source: Medium { - carried: "test fn probe_one() -> Bool { true }\n", - fidelity: Lossless - }, - artifact: Artifact { - kind: SourceFile, - id: ^module_less_violation_artifact, - file_path: "src/v2/test/violation_orphan.dag" - }, - compilation_unit: symbol_intern_lexeme(lexeme: "src/v2/test/violation_orphan.dag"), - source_root: v2.std.cross_tree.import_model.V2Tree -} +data non_member_violation_read: DagSourceReadWitness = violation_read_for( + content: "module v2.testing.violation_probe\n\ntest fn probe_one() -> Bool { true }\n" +) + +data module_less_violation_read: DagSourceReadWitness = violation_read_for( + content: "test fn probe_one() -> Bool { true }\n" +) data member_violation_ingest: SourceRootIngest = [member_violation_read] data non_member_violation_ingest: SourceRootIngest = [non_member_violation_read] diff --git a/src/v2/compiler/00_compile.dag b/src/v2/compiler/00_compile.dag index 19198a78d73..4c1adfa1254 100644 --- a/src/v2/compiler/00_compile.dag +++ b/src/v2/compiler/00_compile.dag @@ -2244,16 +2244,34 @@ fn native_lane_universe(ingest: SourceRootIngest) -> Outcome // THE SOURCE FACTS ARE DERIVED ONCE AND CARRIED, BECAUSE THE LANE'S MAIN ALREADY HOLDS THEM. // // `native_lane_source_facts` is a fold over the WHOLE ingest that, per read, splits the file into -// lines, scans for the module header, scans for imports, scans for the first malformed import, and -// runs `discover_floor_rows_for_source`. It is corpus-wide BY DESIGN -- discovery is a corpus-wide -// question and its refusals must hold outside any selection -- which is exactly what makes paying -// for it twice expensive rather than merely untidy. +// lines, scans for the module header, scans for imports, and scans for the first malformed import. +// Those three scans stay corpus-wide, because they protect THIS LANE'S OWN COMPLETENESS: a +// malformed import line in any module the closure walk can reach would silently narrow the +// closure. Discovery no longer joins them for every read -- native_lane_discovery_for walks a +// universe member or a module-less source and hands a zero state for anything else. +// +// THE PIPELINE AS IT NOW STANDS, because a reader meeting this function should not have to +// assemble it: +// +// read the supplied inventory, scan module and import facts (corpus-wide) +// -> run discovery for native-universe members and module-less sources +// -> finalize those discovery outcomes +// -> apply the requested target pattern +// -> prepare the selected tests' dependency closure +// +// THE NATIVE-UNIVERSE BOUNDARY IS NOT THE SEVEN-TEST BOUNDARY, and conflating them would overstate +// what this buys. Discovery is scoped to `v2.test.*` membership, not to the requested pattern, so +// a run naming one package still walks every other native test module before the pattern narrows +// the population -- and acquisition and the import scans remain broader still. This is an +// incremental reduction with a boundary that is visible on purpose, not the focused path's final +// shape. // // MEASURED, on the first native run of a selected pattern (2026-09-21, seven identities of // `v2.test.parse.expression_bodied_fn_decl_parse` at `//v2/test/parse/...:all`): the lane's own // `[native-cost-partition]` receipt reports `universe_derivation` at 23.35 s of a 121.4 s wall, -// over `corpus_reads` 6482 while `closure_reads` was 133. So this is the phase that does NOT -// narrow with the pattern, and it was being entered twice per run. +// over `corpus_reads` 6482 while `closure_reads` was 133. That figure is the OLD PHASE COST, not a +// saving demonstrated by this change: it says the phase did not narrow with the pattern and was +// entered twice per run. What the saving actually is has to come from an integrated native run. // // The rendered adjudicate main binds `source_facts` for the closure derivation -- // `native_lane_closure_modules`, `native_lane_closure_ingest`, `native_lane_ingest_receipt` and @@ -2267,8 +2285,14 @@ fn native_lane_universe(ingest: SourceRootIngest) -> Outcome // THE SPLIT IS WHERE THE VALUE ALREADY WAS. The body took `facts` after its first line, so // `native_lane_universe_of_facts` IS that body and this stays the ingest-taking entry for callers // that do not already hold the facts. The PATTERN is threaded rather than defaulted, so the entry -// the main calls is the same one a caller naming a narrower pattern reaches -- when the argv -// operand lands, that call site changes its pattern argument and nothing else. +// the main calls is the same one a caller naming a narrower pattern reaches, so a call site +// naming a different pattern changes that argument and nothing else. +// +// WHAT A NATIVE BUILD WOULD AND WOULD NOT ESTABLISH: that the rendered main passes the facts it +// already bound is a property of emitted Rust, and no `.dag` arm holds it -- but a SUCCESSFUL +// BUILD ALONE PROVES COMPILATION, NOT THE ABSENCE OF A SECOND FOLD. Establishing that needs the +// produced main and its call path inspected for the carried binding, with the runtime claim read +// off the lane's existing `[native-cost-partition]` observations. fn native_lane_universe_selected(ingest: SourceRootIngest, pattern: TargetPattern) -> Outcome { native_lane_universe_of_facts(facts: native_lane_source_facts(ingest: ingest), pattern: pattern) } From 0cea57340083e7558120dcbc4eea1c40c472b60b Mon Sep 17 00:00:00 2001 From: gunbc-ci-auto-heal Date: Tue, 22 Sep 2026 02:10:35 +0000 Subject: [PATCH 6/9] The selected-universe note described the call site this branch changed Two stale claims in the paragraph above the pipeline explanation, both about behaviour this branch alters: `native_lane_universe` was described as "what the lane's rendered main calls". The rendered main now calls native_lane_universe_of_facts with the facts it already holds and the pattern it was asked for; this entry remains for callers that hold an ingest and not facts. "A corpus refusal outside the pattern still refuses" was true of selection and is still true of it -- a refusal from a source this lane WALKS survives a pattern that excludes it -- but read as a corpus-wide guarantee it now overstates: discovery no longer walks non-members, so a violation there is not this lane's to raise. The note now separates what SELECTION does with refusals from which sources are WALKED, and points at the finalize where that boundary is argued. Documentation only; no production or witness behaviour changes. Co-Authored-By: Claude Opus 5 (1M context) --- src/v2/compiler/00_compile.dag | 17 ++++++++++++----- 1 file changed, 12 insertions(+), 5 deletions(-) diff --git a/src/v2/compiler/00_compile.dag b/src/v2/compiler/00_compile.dag index 4c1adfa1254..c84462d4874 100644 --- a/src/v2/compiler/00_compile.dag +++ b/src/v2/compiler/00_compile.dag @@ -2236,11 +2236,18 @@ fn native_lane_universe(ingest: SourceRootIngest) -> Outcome native_lane_universe_selected(ingest: ingest, pattern: native_route_default_pattern()) } -// THE SELECTED UNIVERSE: the same derivation, every refusal intact, over the identities `pattern` -// admits. `native_lane_universe` is this at the default pattern and is what the lane's rendered -// main calls; a caller naming a narrower pattern gets a narrower population through the same -// producer -- never a filter applied to the default universe after the fact, so a corpus refusal -// outside the pattern still refuses (a narrower question does not make a broken corpus sound). +// THE SELECTED UNIVERSE: the same derivation over the identities `pattern` admits. +// `native_lane_universe` is this at the default pattern. THE RENDERED MAIN NO LONGER CALLS IT -- +// it calls `native_lane_universe_of_facts` with the facts it already holds and the pattern it was +// asked for; this entry remains for callers that hold an ingest and not facts. +// +// A caller naming a narrower pattern gets a narrower population through the same producer, never a +// filter applied to the default universe after the fact. So a refusal raised by a source this lane +// WALKS still refuses even when the pattern excludes that source -- a narrower question does not +// make a broken corpus sound. What changed is which sources are walked at all, not what selection +// does with their refusals: discovery is scoped to universe members and module-less sources by +// `native_lane_discovery_for`, so a violation in a non-member is no longer this lane's to raise. +// That boundary, and the required floor that still owns it, are argued at the finalize below. // THE SOURCE FACTS ARE DERIVED ONCE AND CARRIED, BECAUSE THE LANE'S MAIN ALREADY HOLDS THEM. // // `native_lane_source_facts` is a fold over the WHOLE ingest that, per read, splits the file into From c9c46210ab436c7ae8a0ae8530ec61e6e507ecf9 Mon Sep 17 00:00:00 2001 From: Brian Searls Date: Tue, 22 Sep 2026 06:46:54 +0000 Subject: [PATCH 7/9] review 69844: regenerate the emit_rust mirror, and carry what the round also found THE BLOCKING DEFECT. This branch edited src/v1/05_emit_rust.dag without regenerating src/v1/stage0/src/v1_compiler_emit_rust.rs, so the .dag authority and its committed realization disagreed on a line this branch changed and the headline repair existed in no built binary. Verified per file: native_lane_universe_of_facts in the mirror goes 0 -> 1. Round: claim_executor --regen-round-cost --regen-affected-scope, on a base merging origin/main and origin/fix/std-measure-mirror-regen (#12027) as merge commits, coordinated with snappy-deer-443 who serializes v1.compiler.emit_rust. REGEN=0, changed_paths=2, convergence_stages=1. WHY AN UNRELATED std_measure.rs CHANGE RIDES ALONG, stated because a reviewer should not have to infer it. #12023 edits v1.compiler.emit_rust, which is under gunbc.regen_affected_set regen_generation_input_prefixes, so the scoped round correctly resolves to WholePopulation -- 157 mirrors, not the two this branch touches. That round emitted std.measure kibibyte_from_byte_size_floor, which main's committed mirror does not carry. It is not scope creep and not a stray write. The function is DECLARED in dag/std/measure.dag, added by 3ab9d319c0 (Pkg4, #11962); main's mirror last moved at 2e6b96c71e, long before; and it is CONSUMED three times in dag/gunbc/compute/host_capacity.dag. So main's mirror has been short a declared, consumed function since Pkg4 landed, and a whole-population regen is what surfaced it. #12027's own head also omits it, which snappy-deer-443 verified independently and withdrew that PR's merge ask over. The cause is a scoped round whose edited .dag set is EMPTY -- a PR editing only a mirror regenerates nothing and reports a fixed point vacuously. That is their finding to file; noted here only to explain why these bytes differ from #12027's and why the correct side was kept rather than dropped to resolve the contention. Controls: native_lane_import_refusal_witness_test 23/23, including all four boundary arms this branch added. Co-Authored-By: Claude Opus 5 (1M context) --- src/v1/stage0/src/std_measure.rs | 4 ++++ src/v1/stage0/src/v1_compiler_emit_rust.rs | 2 +- 2 files changed, 5 insertions(+), 1 deletion(-) diff --git a/src/v1/stage0/src/std_measure.rs b/src/v1/stage0/src/std_measure.rs index 38f29fd46c2..c7ec7f31f3d 100644 --- a/src/v1/stage0/src/std_measure.rs +++ b/src/v1/stage0/src/std_measure.rs @@ -418,6 +418,10 @@ pub fn kibibyte_to_byte_size(k: Kibibyte) -> ByteSize { byte_size((kibibyte_count(k.clone()) * kibi_factor())) } +pub fn kibibyte_from_byte_size_floor(b: ByteSize) -> Kibibyte { + kibibyte((byte_size_count(b.clone()) / kibi_factor())) +} + pub fn mebibyte_to_byte_size(m: Mebibyte) -> ByteSize { byte_size((mebibyte_count(m.clone()) * mebibyte_scale_factor_bytes())) } diff --git a/src/v1/stage0/src/v1_compiler_emit_rust.rs b/src/v1/stage0/src/v1_compiler_emit_rust.rs index 1e28f650350..527907c119b 100644 --- a/src/v1/stage0/src/v1_compiler_emit_rust.rs +++ b/src/v1/stage0/src/v1_compiler_emit_rust.rs @@ -38885,7 +38885,7 @@ pub fn emit_source_root_eval_driver_main_rs( crate::v1_compiler_emit_core_support::module_to_filename(pipeline_module.clone()); Rc::new(TextFile { path: v1_rt::concat(v1_rt::concat(rust_source_root(), "main".to_string()), rust_source_ext()), - content: v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat("// Generated by v1 compiler -- do not edit.".to_string(), "\n".to_string()), "\n".to_string()), "#![allow(unused_parens, clippy::all, clippy::disallowed_macros)]".to_string()), "\n".to_string()), "\n".to_string()), "use std::rc::Rc;".to_string()), "\n".to_string()), "use std::time::Instant;".to_string()), "\n".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::extdeps_communication_medium::{DecodeFidelity, Medium};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::gunbc_witness_v2_native_route::{NativeRouteEmittedBuild, NativeRouteMalformedControl, NativeRouteOldRouteControl};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::".to_string()), pipeline_mod.clone()), "::{".to_string()), "\n".to_string()), " native_census_module_resolution, native_census_modules, native_census_residual_rows,".to_string()), "\n".to_string()), " native_lane_controls, native_lane_file_refusal_index, native_lane_identity_row,".to_string()), "\n".to_string()), " native_lane_module_inference,".to_string()), "\n".to_string()), " native_lane_module_resolution,".to_string()), "\n".to_string()), " native_lane_closure_ingest, native_lane_closure_modules, native_lane_closure_round_budget,".to_string()), "\n".to_string()), " native_lane_ingest_matches_closure, native_lane_ingest_receipt, native_lane_receipt,".to_string()), "\n".to_string()), " native_lane_source_facts, native_lane_universe_selected, native_test_context_absorb,".to_string()), "\n".to_string()), " native_test_context_finish, native_test_context_from_ingest, native_test_context_state_empty,".to_string()), "\n".to_string()), " native_test_front_end_prepare,".to_string()), "\n".to_string()), " native_driver_parse, native_driver_plan_exit, native_driver_plan_source_roots,".to_string()), "\n".to_string()), " NativeDriverPlan, NativeDriverVerb,".to_string()), "\n".to_string()), " NativeCensusModuleOutcome,".to_string()), "\n".to_string()), " NativeLaneHostFacts, NativeLaneModulePreparation, NativeLaneModuleResolution,".to_string()), "\n".to_string()), " NativeRouteMemberRow,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_compiler_program_assembly::{".to_string()), "\n".to_string()), " program_assembly_measured_outcome, program_assembly_memo_hits,".to_string()), "\n".to_string()), " program_assembly_memo_lookup_calls, program_assembly_memo_misses,".to_string()), "\n".to_string()), " program_assembly_phase_normalize, program_assembly_phase_parse_measured,".to_string()), "\n".to_string()), " program_assembly_phase_token_count, program_assembly_phase_tokenize,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::gunbc_witness_v2_native_route::{".to_string()), "\n".to_string()), " native_route_admission, native_route_admission_summary, native_route_admitted,".to_string()), "\n".to_string()), " native_route_file_refusal_tally, native_route_member_row_text,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_compiler_native_test_vocabulary::NativeTestVerdict;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_compiler_source_authority::{source_root_for_storage_path, DagSourceReadWitness};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_std_artifact::{Artifact, ArtifactKind};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_std_diagnostic::Outcome;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::std_process::ProcessExit;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::extdeps_bazel_target_pattern::TargetPattern;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::std_compiler_entry::{".to_string()), "\n".to_string()), " native_driver_cost_account, native_driver_cost_remainder_tolerance_nanos,".to_string()), "\n".to_string()), " native_driver_exclusive_sum, NativeDriverCostAccounting,".to_string()), "\n".to_string()), " native_driver_exclusive_rows, native_driver_exclusive_row_name,".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::std_measure::{nanosecond, nanosecond_count};".to_string()), "\n".to_string()), "\n".to_string()), emit_host_source_root_read_rs()), "fn host_fact(facts: &std::collections::HashMap, key: &str) -> String {".to_string()), "\n".to_string()), " match facts.get(key) {".to_string()), "\n".to_string()), " Some(value) => value.clone(),".to_string()), "\n".to_string()), " None => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: host facts file carries no {key} row\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn host_fact_int(facts: &std::collections::HashMap, key: &str) -> i64 {".to_string()), "\n".to_string()), " let value = host_fact(facts, key);".to_string()), "\n".to_string()), " match value.parse::() {".to_string()), "\n".to_string()), " Ok(parsed) => parsed,".to_string()), "\n".to_string()), " Err(cause) => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: host fact {key} is not an integer: {value:?} ({cause})\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn read_host_facts(path: &str) -> NativeLaneHostFacts {".to_string()), "\n".to_string()), " let text = match std::fs::read_to_string(path) {".to_string()), "\n".to_string()), " Ok(text) => text,".to_string()), "\n".to_string()), " Err(cause) => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: could not read host facts file {path}: {cause}\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let mut facts: std::collections::HashMap = std::collections::HashMap::new();".to_string()), "\n".to_string()), " for line in text.lines() {".to_string()), "\n".to_string()), " if line.is_empty() {".to_string()), "\n".to_string()), " continue;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " match line.split_once('\\t') {".to_string()), "\n".to_string()), " Some((key, value)) if !key.is_empty() => {".to_string()), "\n".to_string()), " if facts.insert(key.to_string(), value.to_string()).is_some() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: duplicate host fact row: {key}\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " _ => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: malformed host fact line (expected keyvalue): {line}\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let malformed_path = host_fact(&facts, \"malformed_control_path\");".to_string()), "\n".to_string()), " let malformed_reason = host_fact(&facts, \"malformed_control_reason\");".to_string()), "\n".to_string()), " let malformed_control = if malformed_path.is_empty() {".to_string()), "\n".to_string()), " NativeRouteMalformedControl::MalformedSpecimenAccepted".to_string()), "\n".to_string()), " } else {".to_string()), "\n".to_string()), " NativeRouteMalformedControl::MalformedSpecimenRefused {".to_string()), "\n".to_string()), " path: malformed_path,".to_string()), "\n".to_string()), " reason: malformed_reason,".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let old_route_disposition = host_fact(&facts, \"old_route_disposition\");".to_string()), "\n".to_string()), " let old_route_executable = host_fact(&facts, \"old_route_executable\");".to_string()), "\n".to_string()), " let old_route_control = match old_route_disposition.as_str() {".to_string()), "\n".to_string()), " \"withdrawn\" => NativeRouteOldRouteControl::OldRouteWithdrawn {".to_string()), "\n".to_string()), " withdrawn_executable: old_route_executable,".to_string()), "\n".to_string()), " },".to_string()), "\n".to_string()), " \"not_present_at_window\" => NativeRouteOldRouteControl::OldRouteNotPresentAtWindow {".to_string()), "\n".to_string()), " expected_executable: old_route_executable,".to_string()), "\n".to_string()), " },".to_string()), "\n".to_string()), " other => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: old_route_disposition names no control this route can record: {other} -- expected withdrawn or not_present_at_window\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " // The emitted build is the host's observation of the cargo spawn this binary is the".to_string()), "\n".to_string()), " // product of: six rows, the argv as one row per word under a length row. A count that".to_string()), "\n".to_string()), " // does not parse, or an index row it promises that is missing, refuses like any other".to_string()), "\n".to_string()), " // missing fact; nothing is defaulted.".to_string()), "\n".to_string()), " let cargo_argv_len = host_fact_int(&facts, \"cargo_argv_len\");".to_string()), "\n".to_string()), " let mut cargo_argv: Vec = Vec::new();".to_string()), "\n".to_string()), " for index in 0..cargo_argv_len {".to_string()), "\n".to_string()), " cargo_argv.push(host_fact(&facts, &format!(\"cargo_argv_{index}\")));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let emitted_build = NativeRouteEmittedBuild {".to_string()), "\n".to_string()), " cargo_argv: Rc::new(cargo_argv.into()),".to_string()), "\n".to_string()), " rustflags: host_fact(&facts, \"rustflags\"),".to_string()), "\n".to_string()), " compiler_path: host_fact(&facts, \"compiler_path\"),".to_string()), "\n".to_string()), " rustc_identity: host_fact(&facts, \"rustc_identity\"),".to_string()), "\n".to_string()), " exit_status: host_fact_int(&facts, \"exit_status\"),".to_string()), "\n".to_string()), " warning_count: host_fact_int(&facts, \"warning_count\"),".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " NativeLaneHostFacts {".to_string()), "\n".to_string()), " tested_tree: host_fact(&facts, \"tested_tree\"),".to_string()), "\n".to_string()), " preparation_seed_identity: host_fact(&facts, \"preparation_seed_identity\"),".to_string()), "\n".to_string()), " emitted_closure_identity: host_fact(&facts, \"emitted_closure_identity\"),".to_string()), "\n".to_string()), " executable_path: host_fact(&facts, \"executable_path\"),".to_string()), "\n".to_string()), " executable_identity: host_fact(&facts, \"executable_identity\"),".to_string()), "\n".to_string()), " old_route_control: Rc::new(old_route_control),".to_string()), "\n".to_string()), " malformed_control: Rc::new(malformed_control),".to_string()), "\n".to_string()), " emitted_build: Rc::new(emitted_build),".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn run_census(source_roots: &[String]) {".to_string()), "\n".to_string()), " if source_roots.is_empty() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: no source roots given\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let reads = read_ingest(source_roots);".to_string()), "\n".to_string()), " let context = match &*native_test_context_from_ingest(Rc::new(reads.into())) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CONTEXT-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " for refusal in context.file_refusals.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"file_refusal\": refusal }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"_terminal\": \"complete\", \"mode\": \"census\", \"file_refusals\": context.file_refusals.len() }));".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "// THE THIRD MODE: THE WHOLE TREE, RESOLVED PER MODULE.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// WHY IT IS NOT A FLAG ON `census`. That mode has a live consumer -- the malformed control,".to_string()), "\n".to_string()), "// which the host runner spawns over a ONE-FILE scratch root and reads one per-file refusal".to_string()), "\n".to_string()), "// from -- and teaching it to resolve would make that control pay a whole-tree resolve to".to_string()), "\n".to_string()), "// learn a fact the front end already answered. Two modes because they are two subjects: a".to_string()), "\n".to_string()), "// roster of front-end refusals, and a roster of resolve refusals over every ingested module.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// WHY IT IS NOT THE `adjudicate` LOOP WIDENED. That loop walks `universe.modules` -- the".to_string()), "\n".to_string()), "// v2.test.* modules discovery enrolled rows for -- over a context folded from the import".to_string()), "\n".to_string()), "// CLOSURE of those modules. Both narrowings are correct for what adjudication asks and wrong".to_string()), "\n".to_string()), "// for a census: a residual reported over the closure of the test corpus is not a residual over".to_string()), "\n".to_string()), "// the tree, and the absence of a refusal in a population that was never resolved establishes".to_string()), "\n".to_string()), "// nothing about the dependents outside it.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// THE RESOLVED TREE IS NOT KEPT. NativeCensusModuleOutcome carries the diagnostics of a refusal".to_string()), "\n".to_string()), "// and nothing on the accepted arm, so each module's tree dies with the call that made it. The".to_string()), "\n".to_string()), "// adjudicating loop drops its tree explicitly because it must hold one to infer from; this loop".to_string()), "\n".to_string()), "// never holds one, which is the property that makes the whole-tree grain affordable at all.".to_string()), "\n".to_string()), "fn run_census_resolve(source_roots: &[String]) {".to_string()), "\n".to_string()), " if source_roots.is_empty() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: no source roots given\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let load_started = Instant::now();".to_string()), "\n".to_string()), " let reads = read_ingest(source_roots);".to_string()), "\n".to_string()), " let corpus_reads = reads.len();".to_string()), "\n".to_string()), " let ingest = Rc::new(im::vector::Vector::from(reads));".to_string()), "\n".to_string()), " let load_nanos = span_nanos(load_started);".to_string()), "\n".to_string()), " let context_started = Instant::now();".to_string()), "\n".to_string()), " let context = match &*native_test_context_from_ingest(ingest.clone()) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CONTEXT-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let context_nanos = span_nanos(context_started);".to_string()), "\n".to_string()), " // The front-end refusals are reported in the same shape `census` reports them, because they".to_string()), "\n".to_string()), " // are the same fact read from the same context: a module whose file the context refused is".to_string()), "\n".to_string()), " // attributed there and is NOT re-reported below as a resolve refusal it never reached.".to_string()), "\n".to_string()), " for refusal in context.file_refusals.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"file_refusal\": refusal }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let refusal_index = native_lane_file_refusal_index(context.file_refusals.clone());".to_string()), "\n".to_string()), " let roster_started = Instant::now();".to_string()), "\n".to_string()), " let modules = native_census_modules(ingest.clone());".to_string()), "\n".to_string()), " let roster_nanos = span_nanos(roster_started);".to_string()), "\n".to_string()), " let mut resolve_total_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut resolve_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " let mut resolved_ok: u64 = 0;".to_string()), "\n".to_string()), " let mut file_refused: u64 = 0;".to_string()), "\n".to_string()), " let mut resolve_refused: u64 = 0;".to_string()), "\n".to_string()), " let mut residual_rows: u64 = 0;".to_string()), "\n".to_string()), " for entry in modules.iter() {".to_string()), "\n".to_string()), " let resolve_started = Instant::now();".to_string()), "\n".to_string()), " let outcome = native_census_module_resolution(".to_string()), "\n".to_string()), " context.clone(),".to_string()), "\n".to_string()), " refusal_index.clone(),".to_string()), "\n".to_string()), " entry.clone(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let module_resolve_nanos = span_nanos(resolve_started);".to_string()), "\n".to_string()), " let outcome_label = match &*outcome {".to_string()), "\n".to_string()), " NativeCensusModuleOutcome::NativeCensusModuleFileRefused => {".to_string()), "\n".to_string()), " file_refused += 1;".to_string()), "\n".to_string()), " \"file_refused\"".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeCensusModuleOutcome::NativeCensusModuleResolved => {".to_string()), "\n".to_string()), " resolved_ok += 1;".to_string()), "\n".to_string()), " \"resolved\"".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeCensusModuleOutcome::NativeCensusModuleResolveRefused { diagnostics } => {".to_string()), "\n".to_string()), " resolve_refused += 1;".to_string()), "\n".to_string()), " // ONE ROW PER DIAGNOSTIC, WHICH IS ONE ROW PER REFUSED OCCURRENCE. The rows are".to_string()), "\n".to_string()), " // written as they are decided rather than accumulated: the census is over the".to_string()), "\n".to_string()), " // whole tree, and a population held to the end is a second corpus-sized".to_string()), "\n".to_string()), " // allocation beside the context that produced it.".to_string()), "\n".to_string()), " for row in native_census_residual_rows(entry.clone(), diagnostics.clone()).iter() {".to_string()), "\n".to_string()), " residual_rows += 1;".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"census_residual\": row }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " \"resolve_refused\"".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " resolve_total_nanos += module_resolve_nanos;".to_string()), "\n".to_string()), " resolve_samples.push(module_resolve_nanos);".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"[native-census-resolve] {}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"module\": entry.module.clone(),".to_string()), "\n".to_string()), " \"path\": entry.path.clone(),".to_string()), "\n".to_string()), " \"resolve_nanos\": module_resolve_nanos,".to_string()), "\n".to_string()), " \"outcome\": outcome_label,".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " resolve_samples.sort_unstable();".to_string()), "\n".to_string()), " // THE TERMINAL LINE CARRIES THE COST AND THE POPULATION TOGETHER, because the reading this".to_string()), "\n".to_string()), " // mode exists to support is whether a whole-tree resolve is affordable at all, and a residual".to_string()), "\n".to_string()), " // count without the wall and the peak beside it cannot answer that.".to_string()), "\n".to_string()), " println!(".to_string()), "\n".to_string()), " \"{}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"_terminal\": \"complete\",".to_string()), "\n".to_string()), " \"mode\": \"census-resolve\",".to_string()), "\n".to_string()), " \"corpus_reads\": corpus_reads,".to_string()), "\n".to_string()), " \"modules\": modules.len(),".to_string()), "\n".to_string()), " \"file_refusals\": context.file_refusals.len(),".to_string()), "\n".to_string()), " \"resolved\": resolved_ok,".to_string()), "\n".to_string()), " \"file_refused\": file_refused,".to_string()), "\n".to_string()), " \"resolve_refused\": resolve_refused,".to_string()), "\n".to_string()), " \"residual_rows\": residual_rows,".to_string()), "\n".to_string()), " \"load_nanos\": load_nanos,".to_string()), "\n".to_string()), " \"context_nanos\": context_nanos,".to_string()), "\n".to_string()), " \"roster_nanos\": roster_nanos,".to_string()), "\n".to_string()), " \"resolve_total_nanos\": resolve_total_nanos,".to_string()), "\n".to_string()), " \"resolve_p50_nanos\": native_cost_quantile_nanos(&resolve_samples, 1, 2),".to_string()), "\n".to_string()), " \"resolve_p95_nanos\": native_cost_quantile_nanos(&resolve_samples, 19, 20),".to_string()), "\n".to_string()), " \"resolve_max_nanos\": resolve_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " \"peak_rss_bytes\": proc_status_kib(\"VmHWM\").map(|kib| kib * 1024),".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn native_cost_quantile_nanos(sorted: &[u128], numer: usize, denom: usize) -> u128 {".to_string()), "\n".to_string()), " if sorted.is_empty() { return 0; }".to_string()), "\n".to_string()), " let idx = (sorted.len() - 1) * numer / denom;".to_string()), "\n".to_string()), " sorted[idx]".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// A SPAN IS READ ONCE, THROUGH A READER THAT REFUSES A CLOCK THAT WENT BACKWARDS.".to_string()), "\n".to_string()), "// Instant::elapsed is Instant::now().duration_since(earlier), and duration_since SATURATES:".to_string()), "\n".to_string()), "// a monotonic clock that is not actually monotonic -- which happens on some virtualised and".to_string()), "\n".to_string()), "// migrated hosts -- yields Duration::ZERO rather than an error. That is the fabricated zero".to_string()), "\n".to_string()), "// this receipt forbids, arriving by a quieter route than the saturating_sub it replaced: a".to_string()), "\n".to_string()), "// phase would report as having taken no time and the partition would balance for the wrong".to_string()), "\n".to_string()), "// reason. checked_duration_since returns None instead, so the impossible reading is".to_string()), "\n".to_string()), "// REPRESENTABLE and can be refused.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// AN EARLIER REVISION OF THIS FILE CLAIMED THE CLASS WAS STRUCTURALLY IMPOSSIBLE ONCE THE".to_string()), "\n".to_string()), "// subtraction was gone. That was wrong and is corrected rather than softened: deleting the".to_string()), "\n".to_string()), "// explicit subtraction removed the visible clamp, not the saturation underneath it. The".to_string()), "\n".to_string()), "// honest rung is MITIGATED BY A TYPED REFUSAL at a declared boundary -- the host clock is".to_string()), "\n".to_string()), "// external reality, which DESIGN section 4b keeps off the ladder rather than on its top rung.".to_string()), "\n".to_string()), "fn span_nanos(started: Instant) -> u128 {".to_string()), "\n".to_string()), " match Instant::now().checked_duration_since(started) {".to_string()), "\n".to_string()), " Some(d) => d.as_nanos(),".to_string()), "\n".to_string()), " None => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: the monotonic clock went backwards between two reads, so no span is measurable\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// A SPAN THAT DOES NOT FIT REFUSES RATHER THAN SATURATING (review 64474 control). This was".to_string()), "\n".to_string()), "// i64::try_from(n).unwrap_or(i64::MAX), which turns a failed conversion into a FIGURE -- and a".to_string()), "\n".to_string()), "// fabricated figure on a receipt is the state DESIGN section 5 forbids outright, whether the".to_string()), "\n".to_string()), "// invented number is a zero that reports a phase as instant or a maximum that reports it as".to_string()), "\n".to_string()), "// three centuries. The saturating arm also chose the direction that hides best: i64::MAX would".to_string()), "\n".to_string()), "// push the exclusive sum past the parent and surface as NativeDriverCostOverAttributed, a cost".to_string()), "\n".to_string()), "// verdict naming the wrong cause.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// ON REACHABILITY, STATED RATHER THAN LEFT AS AN IMPLIED CLAIM: i64 nanoseconds is about 292".to_string()), "\n".to_string()), "// years, so no span this driver measures reaches it, and the refusal below is not expected to".to_string()), "\n".to_string()), "// fire. It is written because the alternative is not silence but a LIE -- the arm has to answer".to_string()), "\n".to_string()), "// something, and the only honest answers are a real number or a refusal.".to_string()), "\n".to_string()), "fn native_cost_i64(n: u128) -> i64 {".to_string()), "\n".to_string()), " match i64::try_from(n) {".to_string()), "\n".to_string()), " Ok(v) => v,".to_string()), "\n".to_string()), " Err(cause) => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: a measured span does not fit the cost carrier, so no partition can be reported: {n} ({cause})\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// AN UNREADABLE /proc IS ABSENT, NOT ZERO (review 64181). A zero here was printed as".to_string()), "\n".to_string()), "// peak_rss_bytes / rss_bytes and read as a measurement: a run on a host without /proc, or with".to_string()), "\n".to_string()), "// the key renamed, reported a process using no memory. Absence is carried as None and rendered".to_string()), "\n".to_string()), "// as JSON null, so the receipt says it does not know instead of inventing a figure. This is".to_string()), "\n".to_string()), "// telemetry on no receipt field, so it is the one place an Absent is carried rather than".to_string()), "\n".to_string()), "// refused: the run is still a valid observation of everything else.".to_string()), "\n".to_string()), "fn proc_status_kib(key: &str) -> Option {".to_string()), "\n".to_string()), " let text = std::fs::read_to_string(\"/proc/self/status\").ok()?;".to_string()), "\n".to_string()), " for line in text.lines() {".to_string()), "\n".to_string()), " if let Some(rest) = line.strip_prefix(key) {".to_string()), "\n".to_string()), " return rest".to_string()), "\n".to_string()), " .trim_start_matches(':')".to_string()), "\n".to_string()), " .trim()".to_string()), "\n".to_string()), " .split_whitespace()".to_string()), "\n".to_string()), " .next()".to_string()), "\n".to_string()), " .and_then(|n| n.parse::().ok());".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " None".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// ONE CLOCK, AND IT IS THE MONOTONIC ONE (review 64474). Every exclusive phase span and the".to_string()), "\n".to_string()), "// parent span are read from Instant, so the partition compares readings from a single source.".to_string()), "\n".to_string()), "// They were split before this: the parent came from Instant while the phase spans came from".to_string()), "\n".to_string()), "// SystemTime, which is the wall clock and is free to step backwards under NTP or an operator".to_string()), "\n".to_string()), "// adjustment. A step between two phase reads could then push the exclusive sum past a parent".to_string()), "\n".to_string()), "// span that never moved, and the driver would refuse with NativeDriverCostOverAttributed --".to_string()), "\n".to_string()), "// a cost refusal whose real cause was the clock. That is a fabricated attribution: the numbers".to_string()), "\n".to_string()), "// would be wrong while the receipt read as a measurement.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// THE SUBTRACTION IS GONE RATHER THAN GUARDED, which is the point. A span used to be an".to_string()), "\n".to_string()), "// explicit saturating_sub of two readings, so a backwards step clamped the difference to zero".to_string()), "\n".to_string()), "// and reported a phase as having taken NO TIME -- the exact state the annotation beside it".to_string()), "\n".to_string()), "// forbade, reached by the arm meant to prevent it. Instant::elapsed cannot return a negative".to_string()), "\n".to_string()), "// duration, so there is no difference to clamp and no clamp to review: DESIGN section 5".to_string()), "\n".to_string()), "// construction over validation, and the class climbs from mitigated to structurally".to_string()), "\n".to_string()), "// impossible. The pre-epoch refusal that guarded the old wall-clock read is DELETED with it,".to_string()), "\n".to_string()), "// because the hazard it named cannot arise on this clock -- production handling dissolves on".to_string()), "\n".to_string()), "// the climb (DESIGN section 4b(4)); no evidence is retired here, since that arm had none.".to_string()), "\n".to_string()), "fn run_adjudication(facts_path: &str, pattern: Rc, source_roots: &[String]) {".to_string()), "\n".to_string()), " let driver_start = Instant::now();".to_string()), "\n".to_string()), " // A MISSING GITHUB_SHA IS ABSENT, NOT \"local\" (review 64181). The receipt line carries this".to_string()), "\n".to_string()), " // as the tree the measurement describes; the literal \"local\" is a plausible identity that".to_string()), "\n".to_string()), " // no reader can distinguish from a tree actually named local.".to_string()), "\n".to_string()), " let head: Option = std::env::var(\"GITHUB_SHA\").ok();".to_string()), "\n".to_string()), " let facts = read_host_facts(facts_path);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // the load row: reading the declared roots off disk. Its own exclusive row rather than a".to_string()), "\n".to_string()), " // field on another phase, so the IO is never mixed into a fold's number.".to_string()), "\n".to_string()), " let load_started = Instant::now();".to_string()), "\n".to_string()), " if source_roots.is_empty() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: no source roots given\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let reads = read_ingest(source_roots);".to_string()), "\n".to_string()), " let corpus_reads = reads.len();".to_string()), "\n".to_string()), " let ingest = Rc::new(im::vector::Vector::from(reads));".to_string()), "\n".to_string()), " let load_nanos = span_nanos(load_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // universe_derivation: the floor's own per-file discovery fold plus the module-header and".to_string()), "\n".to_string()), " // import scans, over EVERY read -- discovery is a corpus-wide question -- and then the".to_string()), "\n".to_string()), " // import closure of the universe's modules, which is all the front end is given.".to_string()), "\n".to_string()), " let universe_started = Instant::now();".to_string()), "\n".to_string()), " let source_facts = native_lane_source_facts(ingest.clone());".to_string()), "\n".to_string()), " let universe = match &*native_lane_universe_selected(ingest.clone(), pattern.clone()) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"DERIVATION-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " // The walk's budget exhausting is a refusal of the whole derivation, never a truncated".to_string()), "\n".to_string()), " // closure: a narrowed ingest would surface only as unexplained resolve refusals later.".to_string()), "\n".to_string()), " let closure = match &*native_lane_closure_modules(".to_string()), "\n".to_string()), " source_facts.clone(),".to_string()), "\n".to_string()), " universe.clone(),".to_string()), "\n".to_string()), " native_lane_closure_round_budget(),".to_string()), "\n".to_string()), " ) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CLOSURE-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let closure_ingest = native_lane_closure_ingest(ingest.clone(), source_facts.clone(), closure.clone());".to_string()), "\n".to_string()), " let closure_reads = closure_ingest.len();".to_string()), "\n".to_string()), " // The ingest receipt's identity join, asked by the route: every ingested source declares a".to_string()), "\n".to_string()), " // closure module and every closure module some source declares was ingested. A miss is the".to_string()), "\n".to_string()), " // hidden prepass (or a hidden narrowing) this receipt exists to refuse.".to_string()), "\n".to_string()), " let ingest_receipt = native_lane_ingest_receipt(source_facts.clone(), closure.clone(), closure_ingest.clone());".to_string()), "\n".to_string()), " // The join answers a typed refusal naming the offending identity, so the counts below are".to_string()), "\n".to_string()), " // context for it rather than the whole diagnostic: a reader gets the module and the path,".to_string()), "\n".to_string()), " // not a pair of totals to re-derive the offender from.".to_string()), "\n".to_string()), " match &*native_lane_ingest_matches_closure(source_facts.clone(), ingest_receipt.clone(), closure_ingest.clone()) {".to_string()), "\n".to_string()), " Outcome::Accepted { .. } => {}".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"INGEST-CLOSURE-REFUSED: {:#?} (scanned={} ingested={} closure_modules={})\",".to_string()), "\n".to_string()), " diagnostics,".to_string()), "\n".to_string()), " ingest_receipt.scanned_paths.len(),".to_string()), "\n".to_string()), " ingest_receipt.ingested_paths.len(),".to_string()), "\n".to_string()), " ingest_receipt.closure_modules.len(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let universe_nanos = span_nanos(universe_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // the context row: the front-end fold over the CLOSURE only, entered ONE PHASE AT A TIME.".to_string()), "\n".to_string()), " // The driver owns the clock, so it is the only place a phase span can be read; the phases".to_string()), "\n".to_string()), " // themselves are v2.compiler.program_assembly declarations and each binds the previous".to_string()), "\n".to_string()), " // phase's Outcome, so each phase BODY is single-authored and only the ORDER and the".to_string()), "\n".to_string()), " // inter-phase diagnostic merge exist twice -- here and in the modeled composition".to_string()), "\n".to_string()), " // program_assembly_read_to_normalized_root_prepared.".to_string()), "\n".to_string()), " //".to_string()), "\n".to_string()), " // THAT SECOND SPELLING IS ADMITTED DEBT AND IS FILED, NOT ASSERTED AWAY (review 65068):".to_string()), "\n".to_string()), " // gunbc.recurring_failure_mode.realization_respells_a_modeled_folds_sequencing_to_instrument_it.".to_string()), "\n".to_string()), " // An earlier revision of this comment claimed the two are the same computation. Nothing".to_string()), "\n".to_string()), " // executes that claim, and a .dag witness comparing the composition against its own phases".to_string()), "\n".to_string()), " // CANNOT go red -- the composition is defined as the phase chain -- so the honest answer is".to_string()), "\n".to_string()), " // the row and its trigger (a realization seam that yields per-phase spans FROM a modeled".to_string()), "\n".to_string()), " // fold), not a green check. Reordering these calls or dropping the merge that".to_string()), "\n".to_string()), " // program_assembly_phase_parse_measured performs would change the context with nothing red.".to_string()), "\n".to_string()), " let context_started = Instant::now();".to_string()), "\n".to_string()), " // THE ONCE-PER-FOLD INVARIANT IS PAID ONCE, HERE, AND CARRIED INTO EVERY FILE. A second".to_string()), "\n".to_string()), " // dag_language_model() or prepare_grammar() call inside the loop would re-introduce at the".to_string()), "\n".to_string()), " // realization layer exactly the per-file recompute the fold hoisted out.".to_string()), "\n".to_string()), " let front_end = match &*native_test_front_end_prepare() {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CONTEXT-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let front_end_nanos = span_nanos(context_started);".to_string()), "\n".to_string()), " let mut context_state = native_test_context_state_empty();".to_string()), "\n".to_string()), " let mut tokenize_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut parse_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut normalize_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut absorb_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut phase_calls: u64 = 0;".to_string()), "\n".to_string()), " let mut token_total: u64 = 0;".to_string()), "\n".to_string()), " let mut memo_hits_total: u64 = 0;".to_string()), "\n".to_string()), " let mut memo_misses_total: u64 = 0;".to_string()), "\n".to_string()), " let mut memo_lookups_total: u64 = 0;".to_string()), "\n".to_string()), " let mut byte_total: u64 = 0;".to_string()), "\n".to_string()), " let mut context_file_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " for read in closure_ingest.iter() {".to_string()), "\n".to_string()), " let file_started = Instant::now();".to_string()), "\n".to_string()), " let tokenize_started = Instant::now();".to_string()), "\n".to_string()), " let tokens = program_assembly_phase_tokenize(read.clone(), front_end.lm.clone());".to_string()), "\n".to_string()), " let file_tokenize_nanos = span_nanos(tokenize_started);".to_string()), "\n".to_string()), " // The COUNT the time is read against: a span alone cannot separate a large file from a".to_string()), "\n".to_string()), " // per-file constant. Counted outside every phase span so it prices none of them.".to_string()), "\n".to_string()), " let file_tokens = program_assembly_phase_token_count(tokens.clone());".to_string()), "\n".to_string()), " let parse_started = Instant::now();".to_string()), "\n".to_string()), " let measured = program_assembly_phase_parse_measured(".to_string()), "\n".to_string()), " tokens.clone(),".to_string()), "\n".to_string()), " front_end.prepared.clone(),".to_string()), "\n".to_string()), " // The residue field is an Optional whose inner type rides a recursion cycle, so the".to_string()), "\n".to_string()), " // emitted record BOXES it while the phase takes the option by value. Deref the box".to_string()), "\n".to_string()), " // rather than clone it; the sibling fields above are Rc and clone correctly.".to_string()), "\n".to_string()), " (*front_end.residue).clone(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let file_parse_nanos = span_nanos(parse_started);".to_string()), "\n".to_string()), " // The memo accounting rides BESIDE the outcome, so it reports on a refusal too --".to_string()), "\n".to_string()), " // which is the expensive case this instrument exists to read. Counted outside every".to_string()), "\n".to_string()), " // phase span so it prices none of them.".to_string()), "\n".to_string()), " let file_memo_hits = program_assembly_memo_hits(measured.clone());".to_string()), "\n".to_string()), " let file_memo_misses = program_assembly_memo_misses(measured.clone());".to_string()), "\n".to_string()), " let file_memo_lookups = program_assembly_memo_lookup_calls(measured.clone());".to_string()), "\n".to_string()), " let parsed = program_assembly_measured_outcome(measured);".to_string()), "\n".to_string()), " let normalize_started = Instant::now();".to_string()), "\n".to_string()), " let root = program_assembly_phase_normalize(parsed.clone());".to_string()), "\n".to_string()), " let file_normalize_nanos = span_nanos(normalize_started);".to_string()), "\n".to_string()), " // qualified-name read plus source-root index insertion: the half of the per-file step".to_string()), "\n".to_string()), " // that is not the front end, timed separately because a quadratic accumulator would".to_string()), "\n".to_string()), " // live here and nowhere else in this loop.".to_string()), "\n".to_string()), " let absorb_started = Instant::now();".to_string()), "\n".to_string()), " context_state = native_test_context_absorb(context_state.clone(), read.clone(), root.clone());".to_string()), "\n".to_string()), " let file_absorb_nanos = span_nanos(absorb_started);".to_string()), "\n".to_string()), " let file_nanos = span_nanos(file_started);".to_string()), "\n".to_string()), " tokenize_nanos += file_tokenize_nanos;".to_string()), "\n".to_string()), " parse_nanos += file_parse_nanos;".to_string()), "\n".to_string()), " normalize_nanos += file_normalize_nanos;".to_string()), "\n".to_string()), " absorb_nanos += file_absorb_nanos;".to_string()), "\n".to_string()), " phase_calls += 1;".to_string()), "\n".to_string()), " token_total += file_tokens.max(0) as u64;".to_string()), "\n".to_string()), " memo_hits_total += file_memo_hits.max(0) as u64;".to_string()), "\n".to_string()), " memo_misses_total += file_memo_misses.max(0) as u64;".to_string()), "\n".to_string()), " memo_lookups_total += file_memo_lookups.max(0) as u64;".to_string()), "\n".to_string()), " let file_bytes = read.source.carried.len() as u64;".to_string()), "\n".to_string()), " byte_total += file_bytes;".to_string()), "\n".to_string()), " context_file_samples.push(file_nanos);".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"[native-context-split] {}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"path\": read.compilation_unit.clone(),".to_string()), "\n".to_string()), " \"bytes\": file_bytes,".to_string()), "\n".to_string()), " \"tokens\": file_tokens,".to_string()), "\n".to_string()), " \"tokenize_nanos\": file_tokenize_nanos,".to_string()), "\n".to_string()), " \"parse_nanos\": file_parse_nanos,".to_string()), "\n".to_string()), " \"normalize_nanos\": file_normalize_nanos,".to_string()), "\n".to_string()), " \"absorb_nanos\": file_absorb_nanos,".to_string()), "\n".to_string()), " \"file_nanos\": file_nanos,".to_string()), "\n".to_string()), " \"memo_hits\": file_memo_hits,".to_string()), "\n".to_string()), " \"memo_misses\": file_memo_misses,".to_string()), "\n".to_string()), " \"memo_lookup_calls\": file_memo_lookups,".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let context = native_test_context_finish(context_state, front_end.clone(), closure_ingest.clone());".to_string()), "\n".to_string()), " let context_nanos = span_nanos(context_started);".to_string()), "\n".to_string()), " context_file_samples.sort_unstable();".to_string()), "\n".to_string()), " let context_phase_sum = front_end_nanos + tokenize_nanos + parse_nanos + normalize_nanos + absorb_nanos;".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"[native-context-partition] {}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"basis\": \"context_span\",".to_string()), "\n".to_string()), " \"basis_note\": \"exclusive phase rows partition context_nanos; residual is loop overhead and the eprintln per file\",".to_string()), "\n".to_string()), " \"context_nanos\": context_nanos,".to_string()), "\n".to_string()), " \"front_end_prepare_nanos\": front_end_nanos,".to_string()), "\n".to_string()), " \"tokenize_nanos\": tokenize_nanos,".to_string()), "\n".to_string()), " \"parse_nanos\": parse_nanos,".to_string()), "\n".to_string()), " \"normalize_nanos\": normalize_nanos,".to_string()), "\n".to_string()), " \"absorb_nanos\": absorb_nanos,".to_string()), "\n".to_string()), " \"sum_phase_nanos\": context_phase_sum,".to_string()), "\n".to_string()), " \"residual_nanos\": context_nanos.saturating_sub(context_phase_sum),".to_string()), "\n".to_string()), " \"files\": phase_calls,".to_string()), "\n".to_string()), " \"tokenize_calls\": phase_calls,".to_string()), "\n".to_string()), " \"parse_calls\": phase_calls,".to_string()), "\n".to_string()), " \"normalize_calls\": phase_calls,".to_string()), "\n".to_string()), " \"absorb_calls\": phase_calls,".to_string()), "\n".to_string()), " \"front_end_prepare_calls\": 1,".to_string()), "\n".to_string()), " \"tokens\": token_total,".to_string()), "\n".to_string()), " \"memo_hits\": memo_hits_total,".to_string()), "\n".to_string()), " \"memo_misses\": memo_misses_total,".to_string()), "\n".to_string()), " \"memo_lookup_calls\": memo_lookups_total,".to_string()), "\n".to_string()), " \"bytes\": byte_total,".to_string()), "\n".to_string()), " \"file_refusals\": context.file_refusals.len(),".to_string()), "\n".to_string()), " \"file_p50_nanos\": native_cost_quantile_nanos(&context_file_samples, 1, 2),".to_string()), "\n".to_string()), " \"file_p95_nanos\": native_cost_quantile_nanos(&context_file_samples, 19, 20),".to_string()), "\n".to_string()), " \"file_max_nanos\": context_file_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // the prepare and eval rows, entered separately per module so the number the profile".to_string()), "\n".to_string()), " // lane prices -- the eval row -- is the sum of native_lane_identity_row".to_string()), "\n".to_string()), " // and nothing else: not ingest, not resolve, not infer.".to_string()), "\n".to_string()), " let mut population: Vec> = Vec::new();".to_string()), "\n".to_string()), " let mut prepare_total_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut evaluate_total_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut prepare_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " let mut eval_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " let mut prepare_ok: u64 = 0;".to_string()), "\n".to_string()), " let mut prepare_refused: u64 = 0;".to_string()), "\n".to_string()), " let mut module_release_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut relay_emit_nanos: u128 = 0;".to_string()), "\n".to_string()), " // The per-path refusal index is built ONCE here rather than per module: this loop is the".to_string()), "\n".to_string()), " // only place that knows a loop is about to happen, and the join it feeds was O(modules x".to_string()), "\n".to_string()), " // refusals) when each module scanned the refusal list for itself.".to_string()), "\n".to_string()), " let refusal_index = native_lane_file_refusal_index(context.file_refusals.clone());".to_string()), "\n".to_string()), " for entry in universe.modules.iter() {".to_string()), "\n".to_string()), " let prepare_started = Instant::now();".to_string()), "\n".to_string()), " let mut identities: usize = 0;".to_string()), "\n".to_string()), " let mut module_evaluate_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut module_infer_nanos: u128 = 0;".to_string()), "\n".to_string()), " // THE PREPARATION SPAN CLOSES WHEN THE PREPARATION OUTCOME IS ESTABLISHED, BEFORE ANY".to_string()), "\n".to_string()), " // DECLARATION IS EVALUATED. prepare and eval are exclusive rows of one partition, so a".to_string()), "\n".to_string()), " // prepare interval that contained its module's eval intervals would count that work".to_string()), "\n".to_string()), " // twice and inflate the sum against the parent.".to_string()), "\n".to_string()), " //".to_string()), "\n".to_string()), " // THE CLOSE IS THE ARM'S VALUE, NOT AN ASSIGNMENT INSIDE IT. Assigning an outer binding".to_string()), "\n".to_string()), " // from each arm left its initialiser dead, and a dead store is an ERROR in the emitted".to_string()), "\n".to_string()), " // crate (RUSTFLAGS=\"-D warnings\"); silencing it with an allow would be the escape hatch".to_string()), "\n".to_string()), " // DESIGN section 5 forbids. Each arm yields its own span instead, so there is one binding".to_string()), "\n".to_string()), " // site, nothing to overwrite, and the order control has a single spelling to assert on.".to_string()), "\n".to_string()), " let resolve_started = Instant::now();".to_string()), "\n".to_string()), " let resolution = native_lane_module_resolution(context.clone(), refusal_index.clone(), entry.clone());".to_string()), "\n".to_string()), " let module_resolve_nanos = span_nanos(resolve_started);".to_string()), "\n".to_string()), " let (outcome_label, module_prepare_nanos) = match &*resolution {".to_string()), "\n".to_string()), " NativeLaneModuleResolution::NativeLaneModuleContextRowsDecided { rows } => {".to_string()), "\n".to_string()), " let this_prepare = span_nanos(prepare_started);".to_string()), "\n".to_string()), " prepare_refused += 1;".to_string()), "\n".to_string()), " for row in rows.iter() {".to_string()), "\n".to_string()), " population.push(row.clone());".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"context_refused\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeLaneModuleResolution::NativeLaneModuleResolveRowsDecided { rows } => {".to_string()), "\n".to_string()), " let this_prepare = span_nanos(prepare_started);".to_string()), "\n".to_string()), " prepare_refused += 1;".to_string()), "\n".to_string()), " for row in rows.iter() {".to_string()), "\n".to_string()), " population.push(row.clone());".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"resolve_refused\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeLaneModuleResolution::NativeLaneModuleResolved { resolved } => {".to_string()), "\n".to_string()), " let infer_started = Instant::now();".to_string()), "\n".to_string()), " let preparation = native_lane_module_inference(entry.clone(), resolved.clone());".to_string()), "\n".to_string()), " module_infer_nanos = span_nanos(infer_started);".to_string()), "\n".to_string()), " let this_prepare = span_nanos(prepare_started);".to_string()), "\n".to_string()), " match &*preparation {".to_string()), "\n".to_string()), " NativeLaneModulePreparation::NativeLaneModuleRowsDecided { rows } => {".to_string()), "\n".to_string()), " prepare_refused += 1;".to_string()), "\n".to_string()), " for row in rows.iter() {".to_string()), "\n".to_string()), " population.push(row.clone());".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"infer_refused\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeLaneModulePreparation::NativeLaneModulePrepared { prepared } => {".to_string()), "\n".to_string()), " prepare_ok += 1;".to_string()), "\n".to_string()), " for declaration in entry.declarations.iter() {".to_string()), "\n".to_string()), " let evaluate_started = Instant::now();".to_string()), "\n".to_string()), " let row = native_lane_identity_row(".to_string()), "\n".to_string()), " prepared.clone(),".to_string()), "\n".to_string()), " entry.module.clone(),".to_string()), "\n".to_string()), " declaration.clone(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let this_eval = span_nanos(evaluate_started);".to_string()), "\n".to_string()), " module_evaluate_nanos += this_eval;".to_string()), "\n".to_string()), " eval_samples.push(this_eval);".to_string()), "\n".to_string()), " population.push(row);".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"accepted\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " prepare_total_nanos += module_prepare_nanos;".to_string()), "\n".to_string()), " evaluate_total_nanos += module_evaluate_nanos;".to_string()), "\n".to_string()), " prepare_samples.push(module_prepare_nanos);".to_string()), "\n".to_string()), " // RELEASE IS MEASURED, NOT LEFT TO SCOPE EXIT. The resolved tree this module built is".to_string()), "\n".to_string()), " // dropped HERE, inside a span, because dropping it at the end of the iteration paid real".to_string()), "\n".to_string()), " // time that no exclusive row covered. An explicit drop makes the cost nameable; scope".to_string()), "\n".to_string()), " // exit hides it. What that cost turned out to BE -- and whether it explains anything --".to_string()), "\n".to_string()), " // is a fact of std.compiler_entry NativeDriverExclusiveRows, not of this template.".to_string()), "\n".to_string()), " let release_started = Instant::now();".to_string()), "\n".to_string()), " drop(resolution);".to_string()), "\n".to_string()), " module_release_nanos += span_nanos(release_started);".to_string()), "\n".to_string()), " // One stderr write per unique module, to a pipe the host runner drains. It is spanned".to_string()), "\n".to_string()), " // because it was paid inside parent_span with no exclusive row over it. What the span".to_string()), "\n".to_string()), " // has since MEASURED, and what the residual is, are facts of std.compiler_entry".to_string()), "\n".to_string()), " // NativeDriverExclusiveRows and are deliberately not restated here: a number copied".to_string()), "\n".to_string()), " // into a generated template rots in a place no fold can reach to correct it.".to_string()), "\n".to_string()), " let relay_started = Instant::now();".to_string()), "\n".to_string()), " eprintln!(\"[native-prepare-split] module={} resolve_nanos={module_resolve_nanos} infer_nanos={module_infer_nanos} prepare_nanos={module_prepare_nanos} decls={} outcome={outcome_label}\", entry.module, identities);".to_string()), "\n".to_string()), " relay_emit_nanos += span_nanos(relay_started);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // receipt_admission: minting the receipt and evaluating the authority's admission and summary".to_string()), "\n".to_string()), " // over it. The controls are executed here because they are receipt inputs, not universe members.".to_string()), "\n".to_string()), " let admission_started = Instant::now();".to_string()), "\n".to_string()), " let receipt = native_lane_receipt(".to_string()), "\n".to_string()), " context.clone(),".to_string()), "\n".to_string()), " universe.clone(),".to_string()), "\n".to_string()), " Rc::new(population.clone().into()),".to_string()), "\n".to_string()), " native_lane_controls(context.clone()),".to_string()), "\n".to_string()), " Rc::new(facts),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let admission = native_route_admission(receipt.clone());".to_string()), "\n".to_string()), " let summary = native_route_admission_summary(admission.clone());".to_string()), "\n".to_string()), " let file_refusal_tally: Vec = native_route_file_refusal_tally(receipt.clone())".to_string()), "\n".to_string()), " .iter()".to_string()), "\n".to_string()), " .map(|row| serde_json::json!(row))".to_string()), "\n".to_string()), " .collect();".to_string()), "\n".to_string()), " let admitted = native_route_admitted(admission.clone());".to_string()), "\n".to_string()), " let admission_nanos = span_nanos(admission_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // row_serialization: SERIALIZING THE OBSERVATIONS AND WRITING THEM, MEASURED (review".to_string()), "\n".to_string()), " // 64181 named this span; #11105 made leaving it unattributed fatal). Every row the".to_string()), "\n".to_string()), " // population carries is turned into JSON here and written to stdout, which is real work".to_string()), "\n".to_string()), " // no other row covers -- eval is the identity fold and nothing else. It is TIMED, never".to_string()), "\n".to_string()), " // derived as parent minus the others: a row defined as the remainder would force the".to_string()), "\n".to_string()), " // residual to zero and make the tolerance arm unfireable by construction.".to_string()), "\n".to_string()), " let serialization_started = Instant::now();".to_string()), "\n".to_string()), " for refusal in receipt.file_refusals.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"file_refusal\": refusal }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " for row in population.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::to_string(row).unwrap());".to_string()), "\n".to_string()), " // THE OPERATOR'S LINE, BESIDE THE PERSISTED ROW. The JSON above is the receipt; this is".to_string()), "\n".to_string()), " // the same value rendered by the authority for a reader of the command's output, so a".to_string()), "\n".to_string()), " // row that did not pass names its subject, stage, cause and position without anyone".to_string()), "\n".to_string()), " // re-deriving them from the bytes just written. Passing rows print nothing here: the".to_string()), "\n".to_string()), " // terminal marker carries their count. EXHAUSTIVE ON PURPOSE -- a verdict arm added to".to_string()), "\n".to_string()), " // the vocabulary must decide here whether it is operator-visible.".to_string()), "\n".to_string()), " match &*row.verdict {".to_string()), "\n".to_string()), " NativeTestVerdict::NativeTestPassed => {}".to_string()), "\n".to_string()), " NativeTestVerdict::NativeTestReturnedFalse".to_string()), "\n".to_string()), " | NativeTestVerdict::NativeTestReturnedOther".to_string()), "\n".to_string()), " | NativeTestVerdict::NativeTestRefused { .. } => {".to_string()), "\n".to_string()), " eprintln!(\"[native-verdict] {}\", native_route_member_row_text(row.clone()));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let row_serialization_nanos = span_nanos(serialization_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // THE PARTITION, THROUGH THE ONE LAW. The rows are the row set std.compiler_entry owns and".to_string()), "\n".to_string()), " // verdict is native_driver_cost_account over them -- not a second reconcile. The two rows".to_string()), "\n".to_string()), " // this route pays that a driver handed a universe file does not (universe_derivation,".to_string()), "\n".to_string()), " // receipt_admission) are members of the same exclusive sum, so an over-attribution through".to_string()), "\n".to_string()), " // either is caught here rather than by a check of its own.".to_string()), "\n".to_string()), " prepare_samples.sort_unstable();".to_string()), "\n".to_string()), " eval_samples.sort_unstable();".to_string()), "\n".to_string()), " let parent_span_nanos = span_nanos(driver_start);".to_string()), "\n".to_string()), " // THE DRIVER IS EXHAUSTIVE OVER THE KEY WITH NO WILDCARD, deliberately: a row added to".to_string()), "\n".to_string()), " // std.compiler_entry makes THIS match refuse to compile until the driver says what".to_string()), "\n".to_string()), " // measures it. A wildcard here would answer zero for a span nobody wired up, which is".to_string()), "\n".to_string()), " // the absorbing arm DESIGN section 5 forbids -- and it is what the old record literal".to_string()), "\n".to_string()), " // did silently, three folds running.".to_string()), "\n".to_string()), " let exclusive = native_driver_exclusive_rows(move |k| match k {".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveLoad => nanosecond(native_cost_i64(load_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveUniverseDerivation => nanosecond(native_cost_i64(universe_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveContext => nanosecond(native_cost_i64(context_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusivePrepare => nanosecond(native_cost_i64(prepare_total_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveEval => nanosecond(native_cost_i64(evaluate_total_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveReceiptAdmission => nanosecond(native_cost_i64(admission_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveRowSerialization => nanosecond(native_cost_i64(row_serialization_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveModuleRelease => nanosecond(native_cost_i64(module_release_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveRelayEmit => nanosecond(native_cost_i64(relay_emit_nanos)),".to_string()), "\n".to_string()), " });".to_string()), "\n".to_string()), " let exclusive_sum = nanosecond_count(native_driver_exclusive_sum(exclusive.clone())) as u128;".to_string()), "\n".to_string()), " let tolerance_nanos = nanosecond_count(native_driver_cost_remainder_tolerance_nanos()) as u128;".to_string()), "\n".to_string()), " let accounting = native_driver_cost_account(".to_string()), "\n".to_string()), " nanosecond(native_cost_i64(parent_span_nanos)),".to_string()), "\n".to_string()), " exclusive.clone(),".to_string()), "\n".to_string()), " native_driver_cost_remainder_tolerance_nanos(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " // The remainder is the residual the accounting itself returns, never parent minus sum: on".to_string()), "\n".to_string()), " // over-attributed arm there IS no remainder, and a clamped zero there would be a".to_string()), "\n".to_string()), " // plausible number standing where the measurement is incoherent.".to_string()), "\n".to_string()), " let (verdict, remainder_nanos) = match accounting.as_ref() {".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostOverAttributed { .. } =>".to_string()), "\n".to_string()), " (r#\"NativeDriverCostOverAttributed\"#, serde_json::Value::Null),".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostRemainderExceedsTolerance { residual, .. } =>".to_string()), "\n".to_string()), " (r#\"NativeDriverCostRemainderExceedsTolerance\"#, serde_json::json!(nanosecond_count(residual.clone()))),".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostReconciled { residual, .. } =>".to_string()), "\n".to_string()), " (r#\"NativeDriverCostReconciled\"#, serde_json::json!(nanosecond_count(residual.clone()))),".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let identities = universe.identities.len() as u64;".to_string()), "\n".to_string()), " let eval_mean = if eval_samples.is_empty() { 0 } else { evaluate_total_nanos / eval_samples.len() as u128 };".to_string()), "\n".to_string()), " let prepare_mean = if prepare_samples.is_empty() { 0 } else { prepare_total_nanos / prepare_samples.len() as u128 };".to_string()), "\n".to_string()), " // THE ROWS ARE PROJECTED FROM THE VALUE, NOT RE-LISTED (review 64181). The field names".to_string()), "\n".to_string()), " // were written once to build NativeDriverExclusiveRows and again to render it, which is the".to_string()), "\n".to_string()), " // second spelling this file warns about for prose, applied to the emitted object: a driver".to_string()), "\n".to_string()), " // gaining a phase would have updated the struct and left the receipt short. Serializing the".to_string()), "\n".to_string()), " // value carries the row set from the type, so the JSON cannot disagree with the fold. The".to_string()), "\n".to_string()), " // rows therefore render as std.measure Nanosecond objects rather than bare integers -- the".to_string()), "\n".to_string()), " // unit travels with the number, which is the point of the type.".to_string()), "\n".to_string()), " // A NON-RECONCILED ARM IS A PROCESS REFUSAL (#11105, review 63891). The receipt is".to_string()), "\n".to_string()), " // printed first so the numbers that caused the refusal are on the wire, and THEN the".to_string()), "\n".to_string()), " // line stops: a verdict string with exit 0 is the inert lens DESIGN section 6 names.".to_string()), "\n".to_string()), " // The full-N run of this route refused here on 158600186 ns against a 50000000 ns".to_string()), "\n".to_string()), " // tolerance before row_serialization was a measured row, which is what put that row on".to_string()), "\n".to_string()), " // the type rather than a wider tolerance on this arm.".to_string()), "\n".to_string()), " eprintln!(\"[native-cost-partition] {}\", serde_json::json!({".to_string()), "\n".to_string()), " \"basis\": \"native_driver_wall\",".to_string()), "\n".to_string()), " \"basis_note\": \"single-threaded SourceRootEvalDriver wall; exclusive rows partition parent_span_nanos\",".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"head\": head,".to_string()), "\n".to_string()), " \"mode\": \"adjudicate\",".to_string()), "\n".to_string()), " \"verdict\": verdict,".to_string()), "\n".to_string()), " \"tolerance_nanos\": tolerance_nanos,".to_string()), "\n".to_string()), " \"parent_span_nanos\": parent_span_nanos,".to_string()), "\n".to_string()), " \"exclusive\": exclusive.rows.iter().map(|r| (".to_string()), "\n".to_string()), " native_driver_exclusive_row_name(r.key.clone()),".to_string()), "\n".to_string()), " serde_json::json!(r.nanos),".to_string()), "\n".to_string()), " )).collect::>(),".to_string()), "\n".to_string()), " \"sum_exclusive_nanos\": exclusive_sum,".to_string()), "\n".to_string()), " \"remainder_nanos\": remainder_nanos,".to_string()), "\n".to_string()), " \"corpus_reads\": corpus_reads,".to_string()), "\n".to_string()), " \"closure_reads\": closure_reads,".to_string()), "\n".to_string()), " \"scanned_paths\": ingest_receipt.scanned_paths.len(),".to_string()), "\n".to_string()), " \"ingested_paths\": ingest_receipt.ingested_paths.len(),".to_string()), "\n".to_string()), " \"closure_modules\": closure.len(),".to_string()), "\n".to_string()), " \"identities\": identities,".to_string()), "\n".to_string()), " \"unique_modules\": universe.modules.len(),".to_string()), "\n".to_string()), " \"file_refusals\": receipt.file_refusals.len(),".to_string()), "\n".to_string()), " \"prepare_ok\": prepare_ok,".to_string()), "\n".to_string()), " \"prepare_refused\": prepare_refused,".to_string()), "\n".to_string()), " \"prepare_mean_nanos\": prepare_mean,".to_string()), "\n".to_string()), " \"prepare_p50_nanos\": native_cost_quantile_nanos(&prepare_samples, 1, 2),".to_string()), "\n".to_string()), " \"prepare_p95_nanos\": native_cost_quantile_nanos(&prepare_samples, 19, 20),".to_string()), "\n".to_string()), " \"prepare_max_nanos\": prepare_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " \"eval_mean_nanos\": eval_mean,".to_string()), "\n".to_string()), " \"eval_p50_nanos\": native_cost_quantile_nanos(&eval_samples, 1, 2),".to_string()), "\n".to_string()), " \"eval_p95_nanos\": native_cost_quantile_nanos(&eval_samples, 19, 20),".to_string()), "\n".to_string()), " \"eval_max_nanos\": eval_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " \"peak_rss_bytes\": proc_status_kib(\"VmHWM\").map(|kib| kib * 1024),".to_string()), "\n".to_string()), " \"rss_bytes\": proc_status_kib(\"VmRSS\").map(|kib| kib * 1024),".to_string()), "\n".to_string()), " }));".to_string()), "\n".to_string()), " match accounting.as_ref() {".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostReconciled { .. } => {}".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostOverAttributed { sum_exclusive, parent_span } => {".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"REFUSED: native driver cost OverAttributed {{ sum_exclusive_nanos: {}, parent_span_nanos: {} }}\",".to_string()), "\n".to_string()), " nanosecond_count(sum_exclusive.clone()) as u128,".to_string()), "\n".to_string()), " nanosecond_count(parent_span.clone()) as u128".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostRemainderExceedsTolerance { residual, tolerance } => {".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"REFUSED: native driver cost RemainderExceedsTolerance {{ residual_nanos: {}, tolerance_nanos: {} }} -- unattributed driver work; name the span, do not widen the tolerance\",".to_string()), "\n".to_string()), " nanosecond_count(residual.clone()) as u128,".to_string()), "\n".to_string()), " nanosecond_count(tolerance.clone()) as u128".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " println!(".to_string()), "\n".to_string()), " \"{}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"_terminal\": \"complete\",".to_string()), "\n".to_string()), " \"mode\": \"adjudicate\",".to_string()), "\n".to_string()), " \"rows\": population.len(),".to_string()), "\n".to_string()), " \"universe\": universe.identities.len(),".to_string()), "\n".to_string()), " \"file_refusals\": receipt.file_refusals.len(),".to_string()), "\n".to_string()), " \"file_refusal_tally\": file_refusal_tally,".to_string()), "\n".to_string()), " \"admitted\": admitted,".to_string()), "\n".to_string()), " \"summary\": summary,".to_string()), "\n".to_string()), " })".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " if admitted {".to_string()), "\n".to_string()), " std::process::exit(0);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "fn main() {".to_string()), "\n".to_string()), " let argv: Vec = std::env::args().skip(1).collect();".to_string()), "\n".to_string()), " let plan = native_driver_parse(Rc::new(argv.into()));".to_string()), "\n".to_string()), " if let ProcessExit::ExitFailure { code, reason } = &*native_driver_plan_exit(plan.clone()) {".to_string()), "\n".to_string()), " eprintln!(\"{reason}\");".to_string()), "\n".to_string()), " std::process::exit(*code as i32);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let source_roots: Vec = native_driver_plan_source_roots(plan.clone()).iter().cloned().collect();".to_string()), "\n".to_string()), " match &*plan {".to_string()), "\n".to_string()), " NativeDriverPlan::NativeDriverPlanRefused { reason, detail } => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: native driver plan refused ({reason:?}) but its exit was success -- {detail}\");".to_string()), "\n".to_string()), " std::process::exit(70);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeDriverPlan::NativeDriverPlanned { verb } => {".to_string()), "\n".to_string()), " let verb: &NativeDriverVerb = verb;".to_string()), "\n".to_string()), " match verb {".to_string()), "\n".to_string()), " NativeDriverVerb::NativeDriverCensus { .. } => run_census(&source_roots),".to_string()), "\n".to_string()), " NativeDriverVerb::NativeDriverCensusResolve { .. } => run_census_resolve(&source_roots),".to_string()), "\n".to_string()), " NativeDriverVerb::NativeDriverAdjudicate { facts_path, pattern, .. } => run_adjudication(facts_path, Rc::new(TargetPattern::clone(pattern)), &source_roots),".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), + content: v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat(v1_rt::concat("// Generated by v1 compiler -- do not edit.".to_string(), "\n".to_string()), "\n".to_string()), "#![allow(unused_parens, clippy::all, clippy::disallowed_macros)]".to_string()), "\n".to_string()), "\n".to_string()), "use std::rc::Rc;".to_string()), "\n".to_string()), "use std::time::Instant;".to_string()), "\n".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::extdeps_communication_medium::{DecodeFidelity, Medium};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::gunbc_witness_v2_native_route::{NativeRouteEmittedBuild, NativeRouteMalformedControl, NativeRouteOldRouteControl};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::".to_string()), pipeline_mod.clone()), "::{".to_string()), "\n".to_string()), " native_census_module_resolution, native_census_modules, native_census_residual_rows,".to_string()), "\n".to_string()), " native_lane_controls, native_lane_file_refusal_index, native_lane_identity_row,".to_string()), "\n".to_string()), " native_lane_module_inference,".to_string()), "\n".to_string()), " native_lane_module_resolution,".to_string()), "\n".to_string()), " native_lane_closure_ingest, native_lane_closure_modules, native_lane_closure_round_budget,".to_string()), "\n".to_string()), " native_lane_ingest_matches_closure, native_lane_ingest_receipt, native_lane_receipt,".to_string()), "\n".to_string()), " native_lane_source_facts, native_lane_universe_of_facts, native_test_context_absorb,".to_string()), "\n".to_string()), " native_test_context_finish, native_test_context_from_ingest, native_test_context_state_empty,".to_string()), "\n".to_string()), " native_test_front_end_prepare,".to_string()), "\n".to_string()), " native_driver_parse, native_driver_plan_exit, native_driver_plan_source_roots,".to_string()), "\n".to_string()), " NativeDriverPlan, NativeDriverVerb,".to_string()), "\n".to_string()), " NativeCensusModuleOutcome,".to_string()), "\n".to_string()), " NativeLaneHostFacts, NativeLaneModulePreparation, NativeLaneModuleResolution,".to_string()), "\n".to_string()), " NativeRouteMemberRow,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_compiler_program_assembly::{".to_string()), "\n".to_string()), " program_assembly_measured_outcome, program_assembly_memo_hits,".to_string()), "\n".to_string()), " program_assembly_memo_lookup_calls, program_assembly_memo_misses,".to_string()), "\n".to_string()), " program_assembly_phase_normalize, program_assembly_phase_parse_measured,".to_string()), "\n".to_string()), " program_assembly_phase_token_count, program_assembly_phase_tokenize,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::gunbc_witness_v2_native_route::{".to_string()), "\n".to_string()), " native_route_admission, native_route_admission_summary, native_route_admitted,".to_string()), "\n".to_string()), " native_route_file_refusal_tally, native_route_member_row_text,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_compiler_native_test_vocabulary::NativeTestVerdict;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_compiler_source_authority::{source_root_for_storage_path, DagSourceReadWitness};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_std_artifact::{Artifact, ArtifactKind};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::v2_std_diagnostic::Outcome;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::std_process::ProcessExit;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::extdeps_bazel_target_pattern::TargetPattern;".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::std_compiler_entry::{".to_string()), "\n".to_string()), " native_driver_cost_account, native_driver_cost_remainder_tolerance_nanos,".to_string()), "\n".to_string()), " native_driver_exclusive_sum, NativeDriverCostAccounting,".to_string()), "\n".to_string()), " native_driver_exclusive_rows, native_driver_exclusive_row_name,".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey,".to_string()), "\n".to_string()), "};".to_string()), "\n".to_string()), "use ".to_string()), crate_name.clone()), "::std_measure::{nanosecond, nanosecond_count};".to_string()), "\n".to_string()), "\n".to_string()), emit_host_source_root_read_rs()), "fn host_fact(facts: &std::collections::HashMap, key: &str) -> String {".to_string()), "\n".to_string()), " match facts.get(key) {".to_string()), "\n".to_string()), " Some(value) => value.clone(),".to_string()), "\n".to_string()), " None => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: host facts file carries no {key} row\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn host_fact_int(facts: &std::collections::HashMap, key: &str) -> i64 {".to_string()), "\n".to_string()), " let value = host_fact(facts, key);".to_string()), "\n".to_string()), " match value.parse::() {".to_string()), "\n".to_string()), " Ok(parsed) => parsed,".to_string()), "\n".to_string()), " Err(cause) => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: host fact {key} is not an integer: {value:?} ({cause})\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn read_host_facts(path: &str) -> NativeLaneHostFacts {".to_string()), "\n".to_string()), " let text = match std::fs::read_to_string(path) {".to_string()), "\n".to_string()), " Ok(text) => text,".to_string()), "\n".to_string()), " Err(cause) => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: could not read host facts file {path}: {cause}\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let mut facts: std::collections::HashMap = std::collections::HashMap::new();".to_string()), "\n".to_string()), " for line in text.lines() {".to_string()), "\n".to_string()), " if line.is_empty() {".to_string()), "\n".to_string()), " continue;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " match line.split_once('\\t') {".to_string()), "\n".to_string()), " Some((key, value)) if !key.is_empty() => {".to_string()), "\n".to_string()), " if facts.insert(key.to_string(), value.to_string()).is_some() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: duplicate host fact row: {key}\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " _ => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: malformed host fact line (expected keyvalue): {line}\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let malformed_path = host_fact(&facts, \"malformed_control_path\");".to_string()), "\n".to_string()), " let malformed_reason = host_fact(&facts, \"malformed_control_reason\");".to_string()), "\n".to_string()), " let malformed_control = if malformed_path.is_empty() {".to_string()), "\n".to_string()), " NativeRouteMalformedControl::MalformedSpecimenAccepted".to_string()), "\n".to_string()), " } else {".to_string()), "\n".to_string()), " NativeRouteMalformedControl::MalformedSpecimenRefused {".to_string()), "\n".to_string()), " path: malformed_path,".to_string()), "\n".to_string()), " reason: malformed_reason,".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let old_route_disposition = host_fact(&facts, \"old_route_disposition\");".to_string()), "\n".to_string()), " let old_route_executable = host_fact(&facts, \"old_route_executable\");".to_string()), "\n".to_string()), " let old_route_control = match old_route_disposition.as_str() {".to_string()), "\n".to_string()), " \"withdrawn\" => NativeRouteOldRouteControl::OldRouteWithdrawn {".to_string()), "\n".to_string()), " withdrawn_executable: old_route_executable,".to_string()), "\n".to_string()), " },".to_string()), "\n".to_string()), " \"not_present_at_window\" => NativeRouteOldRouteControl::OldRouteNotPresentAtWindow {".to_string()), "\n".to_string()), " expected_executable: old_route_executable,".to_string()), "\n".to_string()), " },".to_string()), "\n".to_string()), " other => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: old_route_disposition names no control this route can record: {other} -- expected withdrawn or not_present_at_window\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " // The emitted build is the host's observation of the cargo spawn this binary is the".to_string()), "\n".to_string()), " // product of: six rows, the argv as one row per word under a length row. A count that".to_string()), "\n".to_string()), " // does not parse, or an index row it promises that is missing, refuses like any other".to_string()), "\n".to_string()), " // missing fact; nothing is defaulted.".to_string()), "\n".to_string()), " let cargo_argv_len = host_fact_int(&facts, \"cargo_argv_len\");".to_string()), "\n".to_string()), " let mut cargo_argv: Vec = Vec::new();".to_string()), "\n".to_string()), " for index in 0..cargo_argv_len {".to_string()), "\n".to_string()), " cargo_argv.push(host_fact(&facts, &format!(\"cargo_argv_{index}\")));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let emitted_build = NativeRouteEmittedBuild {".to_string()), "\n".to_string()), " cargo_argv: Rc::new(cargo_argv.into()),".to_string()), "\n".to_string()), " rustflags: host_fact(&facts, \"rustflags\"),".to_string()), "\n".to_string()), " compiler_path: host_fact(&facts, \"compiler_path\"),".to_string()), "\n".to_string()), " rustc_identity: host_fact(&facts, \"rustc_identity\"),".to_string()), "\n".to_string()), " exit_status: host_fact_int(&facts, \"exit_status\"),".to_string()), "\n".to_string()), " warning_count: host_fact_int(&facts, \"warning_count\"),".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " NativeLaneHostFacts {".to_string()), "\n".to_string()), " tested_tree: host_fact(&facts, \"tested_tree\"),".to_string()), "\n".to_string()), " preparation_seed_identity: host_fact(&facts, \"preparation_seed_identity\"),".to_string()), "\n".to_string()), " emitted_closure_identity: host_fact(&facts, \"emitted_closure_identity\"),".to_string()), "\n".to_string()), " executable_path: host_fact(&facts, \"executable_path\"),".to_string()), "\n".to_string()), " executable_identity: host_fact(&facts, \"executable_identity\"),".to_string()), "\n".to_string()), " old_route_control: Rc::new(old_route_control),".to_string()), "\n".to_string()), " malformed_control: Rc::new(malformed_control),".to_string()), "\n".to_string()), " emitted_build: Rc::new(emitted_build),".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn run_census(source_roots: &[String]) {".to_string()), "\n".to_string()), " if source_roots.is_empty() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: no source roots given\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let reads = read_ingest(source_roots);".to_string()), "\n".to_string()), " let context = match &*native_test_context_from_ingest(Rc::new(reads.into())) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CONTEXT-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " for refusal in context.file_refusals.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"file_refusal\": refusal }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"_terminal\": \"complete\", \"mode\": \"census\", \"file_refusals\": context.file_refusals.len() }));".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "// THE THIRD MODE: THE WHOLE TREE, RESOLVED PER MODULE.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// WHY IT IS NOT A FLAG ON `census`. That mode has a live consumer -- the malformed control,".to_string()), "\n".to_string()), "// which the host runner spawns over a ONE-FILE scratch root and reads one per-file refusal".to_string()), "\n".to_string()), "// from -- and teaching it to resolve would make that control pay a whole-tree resolve to".to_string()), "\n".to_string()), "// learn a fact the front end already answered. Two modes because they are two subjects: a".to_string()), "\n".to_string()), "// roster of front-end refusals, and a roster of resolve refusals over every ingested module.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// WHY IT IS NOT THE `adjudicate` LOOP WIDENED. That loop walks `universe.modules` -- the".to_string()), "\n".to_string()), "// v2.test.* modules discovery enrolled rows for -- over a context folded from the import".to_string()), "\n".to_string()), "// CLOSURE of those modules. Both narrowings are correct for what adjudication asks and wrong".to_string()), "\n".to_string()), "// for a census: a residual reported over the closure of the test corpus is not a residual over".to_string()), "\n".to_string()), "// the tree, and the absence of a refusal in a population that was never resolved establishes".to_string()), "\n".to_string()), "// nothing about the dependents outside it.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// THE RESOLVED TREE IS NOT KEPT. NativeCensusModuleOutcome carries the diagnostics of a refusal".to_string()), "\n".to_string()), "// and nothing on the accepted arm, so each module's tree dies with the call that made it. The".to_string()), "\n".to_string()), "// adjudicating loop drops its tree explicitly because it must hold one to infer from; this loop".to_string()), "\n".to_string()), "// never holds one, which is the property that makes the whole-tree grain affordable at all.".to_string()), "\n".to_string()), "fn run_census_resolve(source_roots: &[String]) {".to_string()), "\n".to_string()), " if source_roots.is_empty() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: no source roots given\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let load_started = Instant::now();".to_string()), "\n".to_string()), " let reads = read_ingest(source_roots);".to_string()), "\n".to_string()), " let corpus_reads = reads.len();".to_string()), "\n".to_string()), " let ingest = Rc::new(im::vector::Vector::from(reads));".to_string()), "\n".to_string()), " let load_nanos = span_nanos(load_started);".to_string()), "\n".to_string()), " let context_started = Instant::now();".to_string()), "\n".to_string()), " let context = match &*native_test_context_from_ingest(ingest.clone()) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CONTEXT-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let context_nanos = span_nanos(context_started);".to_string()), "\n".to_string()), " // The front-end refusals are reported in the same shape `census` reports them, because they".to_string()), "\n".to_string()), " // are the same fact read from the same context: a module whose file the context refused is".to_string()), "\n".to_string()), " // attributed there and is NOT re-reported below as a resolve refusal it never reached.".to_string()), "\n".to_string()), " for refusal in context.file_refusals.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"file_refusal\": refusal }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let refusal_index = native_lane_file_refusal_index(context.file_refusals.clone());".to_string()), "\n".to_string()), " let roster_started = Instant::now();".to_string()), "\n".to_string()), " let modules = native_census_modules(ingest.clone());".to_string()), "\n".to_string()), " let roster_nanos = span_nanos(roster_started);".to_string()), "\n".to_string()), " let mut resolve_total_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut resolve_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " let mut resolved_ok: u64 = 0;".to_string()), "\n".to_string()), " let mut file_refused: u64 = 0;".to_string()), "\n".to_string()), " let mut resolve_refused: u64 = 0;".to_string()), "\n".to_string()), " let mut residual_rows: u64 = 0;".to_string()), "\n".to_string()), " for entry in modules.iter() {".to_string()), "\n".to_string()), " let resolve_started = Instant::now();".to_string()), "\n".to_string()), " let outcome = native_census_module_resolution(".to_string()), "\n".to_string()), " context.clone(),".to_string()), "\n".to_string()), " refusal_index.clone(),".to_string()), "\n".to_string()), " entry.clone(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let module_resolve_nanos = span_nanos(resolve_started);".to_string()), "\n".to_string()), " let outcome_label = match &*outcome {".to_string()), "\n".to_string()), " NativeCensusModuleOutcome::NativeCensusModuleFileRefused => {".to_string()), "\n".to_string()), " file_refused += 1;".to_string()), "\n".to_string()), " \"file_refused\"".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeCensusModuleOutcome::NativeCensusModuleResolved => {".to_string()), "\n".to_string()), " resolved_ok += 1;".to_string()), "\n".to_string()), " \"resolved\"".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeCensusModuleOutcome::NativeCensusModuleResolveRefused { diagnostics } => {".to_string()), "\n".to_string()), " resolve_refused += 1;".to_string()), "\n".to_string()), " // ONE ROW PER DIAGNOSTIC, WHICH IS ONE ROW PER REFUSED OCCURRENCE. The rows are".to_string()), "\n".to_string()), " // written as they are decided rather than accumulated: the census is over the".to_string()), "\n".to_string()), " // whole tree, and a population held to the end is a second corpus-sized".to_string()), "\n".to_string()), " // allocation beside the context that produced it.".to_string()), "\n".to_string()), " for row in native_census_residual_rows(entry.clone(), diagnostics.clone()).iter() {".to_string()), "\n".to_string()), " residual_rows += 1;".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"census_residual\": row }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " \"resolve_refused\"".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " resolve_total_nanos += module_resolve_nanos;".to_string()), "\n".to_string()), " resolve_samples.push(module_resolve_nanos);".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"[native-census-resolve] {}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"module\": entry.module.clone(),".to_string()), "\n".to_string()), " \"path\": entry.path.clone(),".to_string()), "\n".to_string()), " \"resolve_nanos\": module_resolve_nanos,".to_string()), "\n".to_string()), " \"outcome\": outcome_label,".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " resolve_samples.sort_unstable();".to_string()), "\n".to_string()), " // THE TERMINAL LINE CARRIES THE COST AND THE POPULATION TOGETHER, because the reading this".to_string()), "\n".to_string()), " // mode exists to support is whether a whole-tree resolve is affordable at all, and a residual".to_string()), "\n".to_string()), " // count without the wall and the peak beside it cannot answer that.".to_string()), "\n".to_string()), " println!(".to_string()), "\n".to_string()), " \"{}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"_terminal\": \"complete\",".to_string()), "\n".to_string()), " \"mode\": \"census-resolve\",".to_string()), "\n".to_string()), " \"corpus_reads\": corpus_reads,".to_string()), "\n".to_string()), " \"modules\": modules.len(),".to_string()), "\n".to_string()), " \"file_refusals\": context.file_refusals.len(),".to_string()), "\n".to_string()), " \"resolved\": resolved_ok,".to_string()), "\n".to_string()), " \"file_refused\": file_refused,".to_string()), "\n".to_string()), " \"resolve_refused\": resolve_refused,".to_string()), "\n".to_string()), " \"residual_rows\": residual_rows,".to_string()), "\n".to_string()), " \"load_nanos\": load_nanos,".to_string()), "\n".to_string()), " \"context_nanos\": context_nanos,".to_string()), "\n".to_string()), " \"roster_nanos\": roster_nanos,".to_string()), "\n".to_string()), " \"resolve_total_nanos\": resolve_total_nanos,".to_string()), "\n".to_string()), " \"resolve_p50_nanos\": native_cost_quantile_nanos(&resolve_samples, 1, 2),".to_string()), "\n".to_string()), " \"resolve_p95_nanos\": native_cost_quantile_nanos(&resolve_samples, 19, 20),".to_string()), "\n".to_string()), " \"resolve_max_nanos\": resolve_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " \"peak_rss_bytes\": proc_status_kib(\"VmHWM\").map(|kib| kib * 1024),".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), "fn native_cost_quantile_nanos(sorted: &[u128], numer: usize, denom: usize) -> u128 {".to_string()), "\n".to_string()), " if sorted.is_empty() { return 0; }".to_string()), "\n".to_string()), " let idx = (sorted.len() - 1) * numer / denom;".to_string()), "\n".to_string()), " sorted[idx]".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// A SPAN IS READ ONCE, THROUGH A READER THAT REFUSES A CLOCK THAT WENT BACKWARDS.".to_string()), "\n".to_string()), "// Instant::elapsed is Instant::now().duration_since(earlier), and duration_since SATURATES:".to_string()), "\n".to_string()), "// a monotonic clock that is not actually monotonic -- which happens on some virtualised and".to_string()), "\n".to_string()), "// migrated hosts -- yields Duration::ZERO rather than an error. That is the fabricated zero".to_string()), "\n".to_string()), "// this receipt forbids, arriving by a quieter route than the saturating_sub it replaced: a".to_string()), "\n".to_string()), "// phase would report as having taken no time and the partition would balance for the wrong".to_string()), "\n".to_string()), "// reason. checked_duration_since returns None instead, so the impossible reading is".to_string()), "\n".to_string()), "// REPRESENTABLE and can be refused.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// AN EARLIER REVISION OF THIS FILE CLAIMED THE CLASS WAS STRUCTURALLY IMPOSSIBLE ONCE THE".to_string()), "\n".to_string()), "// subtraction was gone. That was wrong and is corrected rather than softened: deleting the".to_string()), "\n".to_string()), "// explicit subtraction removed the visible clamp, not the saturation underneath it. The".to_string()), "\n".to_string()), "// honest rung is MITIGATED BY A TYPED REFUSAL at a declared boundary -- the host clock is".to_string()), "\n".to_string()), "// external reality, which DESIGN section 4b keeps off the ladder rather than on its top rung.".to_string()), "\n".to_string()), "fn span_nanos(started: Instant) -> u128 {".to_string()), "\n".to_string()), " match Instant::now().checked_duration_since(started) {".to_string()), "\n".to_string()), " Some(d) => d.as_nanos(),".to_string()), "\n".to_string()), " None => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: the monotonic clock went backwards between two reads, so no span is measurable\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// A SPAN THAT DOES NOT FIT REFUSES RATHER THAN SATURATING (review 64474 control). This was".to_string()), "\n".to_string()), "// i64::try_from(n).unwrap_or(i64::MAX), which turns a failed conversion into a FIGURE -- and a".to_string()), "\n".to_string()), "// fabricated figure on a receipt is the state DESIGN section 5 forbids outright, whether the".to_string()), "\n".to_string()), "// invented number is a zero that reports a phase as instant or a maximum that reports it as".to_string()), "\n".to_string()), "// three centuries. The saturating arm also chose the direction that hides best: i64::MAX would".to_string()), "\n".to_string()), "// push the exclusive sum past the parent and surface as NativeDriverCostOverAttributed, a cost".to_string()), "\n".to_string()), "// verdict naming the wrong cause.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// ON REACHABILITY, STATED RATHER THAN LEFT AS AN IMPLIED CLAIM: i64 nanoseconds is about 292".to_string()), "\n".to_string()), "// years, so no span this driver measures reaches it, and the refusal below is not expected to".to_string()), "\n".to_string()), "// fire. It is written because the alternative is not silence but a LIE -- the arm has to answer".to_string()), "\n".to_string()), "// something, and the only honest answers are a real number or a refusal.".to_string()), "\n".to_string()), "fn native_cost_i64(n: u128) -> i64 {".to_string()), "\n".to_string()), " match i64::try_from(n) {".to_string()), "\n".to_string()), " Ok(v) => v,".to_string()), "\n".to_string()), " Err(cause) => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: a measured span does not fit the cost carrier, so no partition can be reported: {n} ({cause})\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// AN UNREADABLE /proc IS ABSENT, NOT ZERO (review 64181). A zero here was printed as".to_string()), "\n".to_string()), "// peak_rss_bytes / rss_bytes and read as a measurement: a run on a host without /proc, or with".to_string()), "\n".to_string()), "// the key renamed, reported a process using no memory. Absence is carried as None and rendered".to_string()), "\n".to_string()), "// as JSON null, so the receipt says it does not know instead of inventing a figure. This is".to_string()), "\n".to_string()), "// telemetry on no receipt field, so it is the one place an Absent is carried rather than".to_string()), "\n".to_string()), "// refused: the run is still a valid observation of everything else.".to_string()), "\n".to_string()), "fn proc_status_kib(key: &str) -> Option {".to_string()), "\n".to_string()), " let text = std::fs::read_to_string(\"/proc/self/status\").ok()?;".to_string()), "\n".to_string()), " for line in text.lines() {".to_string()), "\n".to_string()), " if let Some(rest) = line.strip_prefix(key) {".to_string()), "\n".to_string()), " return rest".to_string()), "\n".to_string()), " .trim_start_matches(':')".to_string()), "\n".to_string()), " .trim()".to_string()), "\n".to_string()), " .split_whitespace()".to_string()), "\n".to_string()), " .next()".to_string()), "\n".to_string()), " .and_then(|n| n.parse::().ok());".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " None".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "// ONE CLOCK, AND IT IS THE MONOTONIC ONE (review 64474). Every exclusive phase span and the".to_string()), "\n".to_string()), "// parent span are read from Instant, so the partition compares readings from a single source.".to_string()), "\n".to_string()), "// They were split before this: the parent came from Instant while the phase spans came from".to_string()), "\n".to_string()), "// SystemTime, which is the wall clock and is free to step backwards under NTP or an operator".to_string()), "\n".to_string()), "// adjustment. A step between two phase reads could then push the exclusive sum past a parent".to_string()), "\n".to_string()), "// span that never moved, and the driver would refuse with NativeDriverCostOverAttributed --".to_string()), "\n".to_string()), "// a cost refusal whose real cause was the clock. That is a fabricated attribution: the numbers".to_string()), "\n".to_string()), "// would be wrong while the receipt read as a measurement.".to_string()), "\n".to_string()), "//".to_string()), "\n".to_string()), "// THE SUBTRACTION IS GONE RATHER THAN GUARDED, which is the point. A span used to be an".to_string()), "\n".to_string()), "// explicit saturating_sub of two readings, so a backwards step clamped the difference to zero".to_string()), "\n".to_string()), "// and reported a phase as having taken NO TIME -- the exact state the annotation beside it".to_string()), "\n".to_string()), "// forbade, reached by the arm meant to prevent it. Instant::elapsed cannot return a negative".to_string()), "\n".to_string()), "// duration, so there is no difference to clamp and no clamp to review: DESIGN section 5".to_string()), "\n".to_string()), "// construction over validation, and the class climbs from mitigated to structurally".to_string()), "\n".to_string()), "// impossible. The pre-epoch refusal that guarded the old wall-clock read is DELETED with it,".to_string()), "\n".to_string()), "// because the hazard it named cannot arise on this clock -- production handling dissolves on".to_string()), "\n".to_string()), "// the climb (DESIGN section 4b(4)); no evidence is retired here, since that arm had none.".to_string()), "\n".to_string()), "fn run_adjudication(facts_path: &str, pattern: Rc, source_roots: &[String]) {".to_string()), "\n".to_string()), " let driver_start = Instant::now();".to_string()), "\n".to_string()), " // A MISSING GITHUB_SHA IS ABSENT, NOT \"local\" (review 64181). The receipt line carries this".to_string()), "\n".to_string()), " // as the tree the measurement describes; the literal \"local\" is a plausible identity that".to_string()), "\n".to_string()), " // no reader can distinguish from a tree actually named local.".to_string()), "\n".to_string()), " let head: Option = std::env::var(\"GITHUB_SHA\").ok();".to_string()), "\n".to_string()), " let facts = read_host_facts(facts_path);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // the load row: reading the declared roots off disk. Its own exclusive row rather than a".to_string()), "\n".to_string()), " // field on another phase, so the IO is never mixed into a fold's number.".to_string()), "\n".to_string()), " let load_started = Instant::now();".to_string()), "\n".to_string()), " if source_roots.is_empty() {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: no source roots given\");".to_string()), "\n".to_string()), " std::process::exit(2);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let reads = read_ingest(source_roots);".to_string()), "\n".to_string()), " let corpus_reads = reads.len();".to_string()), "\n".to_string()), " let ingest = Rc::new(im::vector::Vector::from(reads));".to_string()), "\n".to_string()), " let load_nanos = span_nanos(load_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // universe_derivation: the floor's own per-file discovery fold plus the module-header and".to_string()), "\n".to_string()), " // import scans, over EVERY read -- discovery is a corpus-wide question -- and then the".to_string()), "\n".to_string()), " // import closure of the universe's modules, which is all the front end is given.".to_string()), "\n".to_string()), " let universe_started = Instant::now();".to_string()), "\n".to_string()), " let source_facts = native_lane_source_facts(ingest.clone());".to_string()), "\n".to_string()), " // The universe is derived FROM THE FACTS ALREADY BOUND, not from the ingest again:".to_string()), "\n".to_string()), " // the ingest-taking entry would re-run the whole-corpus discovery fold the line above".to_string()), "\n".to_string()), " // just paid for, and that fold is the phase the pattern does NOT narrow. See".to_string()), "\n".to_string()), " // v2.compiler.compile native_lane_universe_of_facts -- the pattern is threaded, so this".to_string()), "\n".to_string()), " // is the same entry a narrower pattern reaches, never a filter over a default universe.".to_string()), "\n".to_string()), " let universe = match &*native_lane_universe_of_facts(source_facts.clone(), pattern.clone()) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"DERIVATION-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " // The walk's budget exhausting is a refusal of the whole derivation, never a truncated".to_string()), "\n".to_string()), " // closure: a narrowed ingest would surface only as unexplained resolve refusals later.".to_string()), "\n".to_string()), " let closure = match &*native_lane_closure_modules(".to_string()), "\n".to_string()), " source_facts.clone(),".to_string()), "\n".to_string()), " universe.clone(),".to_string()), "\n".to_string()), " native_lane_closure_round_budget(),".to_string()), "\n".to_string()), " ) {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CLOSURE-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let closure_ingest = native_lane_closure_ingest(ingest.clone(), source_facts.clone(), closure.clone());".to_string()), "\n".to_string()), " let closure_reads = closure_ingest.len();".to_string()), "\n".to_string()), " // The ingest receipt's identity join, asked by the route: every ingested source declares a".to_string()), "\n".to_string()), " // closure module and every closure module some source declares was ingested. A miss is the".to_string()), "\n".to_string()), " // hidden prepass (or a hidden narrowing) this receipt exists to refuse.".to_string()), "\n".to_string()), " let ingest_receipt = native_lane_ingest_receipt(source_facts.clone(), closure.clone(), closure_ingest.clone());".to_string()), "\n".to_string()), " // The join answers a typed refusal naming the offending identity, so the counts below are".to_string()), "\n".to_string()), " // context for it rather than the whole diagnostic: a reader gets the module and the path,".to_string()), "\n".to_string()), " // not a pair of totals to re-derive the offender from.".to_string()), "\n".to_string()), " match &*native_lane_ingest_matches_closure(source_facts.clone(), ingest_receipt.clone(), closure_ingest.clone()) {".to_string()), "\n".to_string()), " Outcome::Accepted { .. } => {}".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"INGEST-CLOSURE-REFUSED: {:#?} (scanned={} ingested={} closure_modules={})\",".to_string()), "\n".to_string()), " diagnostics,".to_string()), "\n".to_string()), " ingest_receipt.scanned_paths.len(),".to_string()), "\n".to_string()), " ingest_receipt.ingested_paths.len(),".to_string()), "\n".to_string()), " ingest_receipt.closure_modules.len(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let universe_nanos = span_nanos(universe_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // the context row: the front-end fold over the CLOSURE only, entered ONE PHASE AT A TIME.".to_string()), "\n".to_string()), " // The driver owns the clock, so it is the only place a phase span can be read; the phases".to_string()), "\n".to_string()), " // themselves are v2.compiler.program_assembly declarations and each binds the previous".to_string()), "\n".to_string()), " // phase's Outcome, so each phase BODY is single-authored and only the ORDER and the".to_string()), "\n".to_string()), " // inter-phase diagnostic merge exist twice -- here and in the modeled composition".to_string()), "\n".to_string()), " // program_assembly_read_to_normalized_root_prepared.".to_string()), "\n".to_string()), " //".to_string()), "\n".to_string()), " // THAT SECOND SPELLING IS ADMITTED DEBT AND IS FILED, NOT ASSERTED AWAY (review 65068):".to_string()), "\n".to_string()), " // gunbc.recurring_failure_mode.realization_respells_a_modeled_folds_sequencing_to_instrument_it.".to_string()), "\n".to_string()), " // An earlier revision of this comment claimed the two are the same computation. Nothing".to_string()), "\n".to_string()), " // executes that claim, and a .dag witness comparing the composition against its own phases".to_string()), "\n".to_string()), " // CANNOT go red -- the composition is defined as the phase chain -- so the honest answer is".to_string()), "\n".to_string()), " // the row and its trigger (a realization seam that yields per-phase spans FROM a modeled".to_string()), "\n".to_string()), " // fold), not a green check. Reordering these calls or dropping the merge that".to_string()), "\n".to_string()), " // program_assembly_phase_parse_measured performs would change the context with nothing red.".to_string()), "\n".to_string()), " let context_started = Instant::now();".to_string()), "\n".to_string()), " // THE ONCE-PER-FOLD INVARIANT IS PAID ONCE, HERE, AND CARRIED INTO EVERY FILE. A second".to_string()), "\n".to_string()), " // dag_language_model() or prepare_grammar() call inside the loop would re-introduce at the".to_string()), "\n".to_string()), " // realization layer exactly the per-file recompute the fold hoisted out.".to_string()), "\n".to_string()), " let front_end = match &*native_test_front_end_prepare() {".to_string()), "\n".to_string()), " Outcome::Accepted { value, .. } => value.clone(),".to_string()), "\n".to_string()), " Outcome::Rejected { diagnostics } => {".to_string()), "\n".to_string()), " eprintln!(\"CONTEXT-REFUSED: {diagnostics:#?}\");".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let front_end_nanos = span_nanos(context_started);".to_string()), "\n".to_string()), " let mut context_state = native_test_context_state_empty();".to_string()), "\n".to_string()), " let mut tokenize_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut parse_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut normalize_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut absorb_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut phase_calls: u64 = 0;".to_string()), "\n".to_string()), " let mut token_total: u64 = 0;".to_string()), "\n".to_string()), " let mut memo_hits_total: u64 = 0;".to_string()), "\n".to_string()), " let mut memo_misses_total: u64 = 0;".to_string()), "\n".to_string()), " let mut memo_lookups_total: u64 = 0;".to_string()), "\n".to_string()), " let mut byte_total: u64 = 0;".to_string()), "\n".to_string()), " let mut context_file_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " for read in closure_ingest.iter() {".to_string()), "\n".to_string()), " let file_started = Instant::now();".to_string()), "\n".to_string()), " let tokenize_started = Instant::now();".to_string()), "\n".to_string()), " let tokens = program_assembly_phase_tokenize(read.clone(), front_end.lm.clone());".to_string()), "\n".to_string()), " let file_tokenize_nanos = span_nanos(tokenize_started);".to_string()), "\n".to_string()), " // The COUNT the time is read against: a span alone cannot separate a large file from a".to_string()), "\n".to_string()), " // per-file constant. Counted outside every phase span so it prices none of them.".to_string()), "\n".to_string()), " let file_tokens = program_assembly_phase_token_count(tokens.clone());".to_string()), "\n".to_string()), " let parse_started = Instant::now();".to_string()), "\n".to_string()), " let measured = program_assembly_phase_parse_measured(".to_string()), "\n".to_string()), " tokens.clone(),".to_string()), "\n".to_string()), " front_end.prepared.clone(),".to_string()), "\n".to_string()), " // The residue field is an Optional whose inner type rides a recursion cycle, so the".to_string()), "\n".to_string()), " // emitted record BOXES it while the phase takes the option by value. Deref the box".to_string()), "\n".to_string()), " // rather than clone it; the sibling fields above are Rc and clone correctly.".to_string()), "\n".to_string()), " (*front_end.residue).clone(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let file_parse_nanos = span_nanos(parse_started);".to_string()), "\n".to_string()), " // The memo accounting rides BESIDE the outcome, so it reports on a refusal too --".to_string()), "\n".to_string()), " // which is the expensive case this instrument exists to read. Counted outside every".to_string()), "\n".to_string()), " // phase span so it prices none of them.".to_string()), "\n".to_string()), " let file_memo_hits = program_assembly_memo_hits(measured.clone());".to_string()), "\n".to_string()), " let file_memo_misses = program_assembly_memo_misses(measured.clone());".to_string()), "\n".to_string()), " let file_memo_lookups = program_assembly_memo_lookup_calls(measured.clone());".to_string()), "\n".to_string()), " let parsed = program_assembly_measured_outcome(measured);".to_string()), "\n".to_string()), " let normalize_started = Instant::now();".to_string()), "\n".to_string()), " let root = program_assembly_phase_normalize(parsed.clone());".to_string()), "\n".to_string()), " let file_normalize_nanos = span_nanos(normalize_started);".to_string()), "\n".to_string()), " // qualified-name read plus source-root index insertion: the half of the per-file step".to_string()), "\n".to_string()), " // that is not the front end, timed separately because a quadratic accumulator would".to_string()), "\n".to_string()), " // live here and nowhere else in this loop.".to_string()), "\n".to_string()), " let absorb_started = Instant::now();".to_string()), "\n".to_string()), " context_state = native_test_context_absorb(context_state.clone(), read.clone(), root.clone());".to_string()), "\n".to_string()), " let file_absorb_nanos = span_nanos(absorb_started);".to_string()), "\n".to_string()), " let file_nanos = span_nanos(file_started);".to_string()), "\n".to_string()), " tokenize_nanos += file_tokenize_nanos;".to_string()), "\n".to_string()), " parse_nanos += file_parse_nanos;".to_string()), "\n".to_string()), " normalize_nanos += file_normalize_nanos;".to_string()), "\n".to_string()), " absorb_nanos += file_absorb_nanos;".to_string()), "\n".to_string()), " phase_calls += 1;".to_string()), "\n".to_string()), " token_total += file_tokens.max(0) as u64;".to_string()), "\n".to_string()), " memo_hits_total += file_memo_hits.max(0) as u64;".to_string()), "\n".to_string()), " memo_misses_total += file_memo_misses.max(0) as u64;".to_string()), "\n".to_string()), " memo_lookups_total += file_memo_lookups.max(0) as u64;".to_string()), "\n".to_string()), " let file_bytes = read.source.carried.len() as u64;".to_string()), "\n".to_string()), " byte_total += file_bytes;".to_string()), "\n".to_string()), " context_file_samples.push(file_nanos);".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"[native-context-split] {}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"path\": read.compilation_unit.clone(),".to_string()), "\n".to_string()), " \"bytes\": file_bytes,".to_string()), "\n".to_string()), " \"tokens\": file_tokens,".to_string()), "\n".to_string()), " \"tokenize_nanos\": file_tokenize_nanos,".to_string()), "\n".to_string()), " \"parse_nanos\": file_parse_nanos,".to_string()), "\n".to_string()), " \"normalize_nanos\": file_normalize_nanos,".to_string()), "\n".to_string()), " \"absorb_nanos\": file_absorb_nanos,".to_string()), "\n".to_string()), " \"file_nanos\": file_nanos,".to_string()), "\n".to_string()), " \"memo_hits\": file_memo_hits,".to_string()), "\n".to_string()), " \"memo_misses\": file_memo_misses,".to_string()), "\n".to_string()), " \"memo_lookup_calls\": file_memo_lookups,".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let context = native_test_context_finish(context_state, front_end.clone(), closure_ingest.clone());".to_string()), "\n".to_string()), " let context_nanos = span_nanos(context_started);".to_string()), "\n".to_string()), " context_file_samples.sort_unstable();".to_string()), "\n".to_string()), " let context_phase_sum = front_end_nanos + tokenize_nanos + parse_nanos + normalize_nanos + absorb_nanos;".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"[native-context-partition] {}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"basis\": \"context_span\",".to_string()), "\n".to_string()), " \"basis_note\": \"exclusive phase rows partition context_nanos; residual is loop overhead and the eprintln per file\",".to_string()), "\n".to_string()), " \"context_nanos\": context_nanos,".to_string()), "\n".to_string()), " \"front_end_prepare_nanos\": front_end_nanos,".to_string()), "\n".to_string()), " \"tokenize_nanos\": tokenize_nanos,".to_string()), "\n".to_string()), " \"parse_nanos\": parse_nanos,".to_string()), "\n".to_string()), " \"normalize_nanos\": normalize_nanos,".to_string()), "\n".to_string()), " \"absorb_nanos\": absorb_nanos,".to_string()), "\n".to_string()), " \"sum_phase_nanos\": context_phase_sum,".to_string()), "\n".to_string()), " \"residual_nanos\": context_nanos.saturating_sub(context_phase_sum),".to_string()), "\n".to_string()), " \"files\": phase_calls,".to_string()), "\n".to_string()), " \"tokenize_calls\": phase_calls,".to_string()), "\n".to_string()), " \"parse_calls\": phase_calls,".to_string()), "\n".to_string()), " \"normalize_calls\": phase_calls,".to_string()), "\n".to_string()), " \"absorb_calls\": phase_calls,".to_string()), "\n".to_string()), " \"front_end_prepare_calls\": 1,".to_string()), "\n".to_string()), " \"tokens\": token_total,".to_string()), "\n".to_string()), " \"memo_hits\": memo_hits_total,".to_string()), "\n".to_string()), " \"memo_misses\": memo_misses_total,".to_string()), "\n".to_string()), " \"memo_lookup_calls\": memo_lookups_total,".to_string()), "\n".to_string()), " \"bytes\": byte_total,".to_string()), "\n".to_string()), " \"file_refusals\": context.file_refusals.len(),".to_string()), "\n".to_string()), " \"file_p50_nanos\": native_cost_quantile_nanos(&context_file_samples, 1, 2),".to_string()), "\n".to_string()), " \"file_p95_nanos\": native_cost_quantile_nanos(&context_file_samples, 19, 20),".to_string()), "\n".to_string()), " \"file_max_nanos\": context_file_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " }),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // the prepare and eval rows, entered separately per module so the number the profile".to_string()), "\n".to_string()), " // lane prices -- the eval row -- is the sum of native_lane_identity_row".to_string()), "\n".to_string()), " // and nothing else: not ingest, not resolve, not infer.".to_string()), "\n".to_string()), " let mut population: Vec> = Vec::new();".to_string()), "\n".to_string()), " let mut prepare_total_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut evaluate_total_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut prepare_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " let mut eval_samples: Vec = Vec::new();".to_string()), "\n".to_string()), " let mut prepare_ok: u64 = 0;".to_string()), "\n".to_string()), " let mut prepare_refused: u64 = 0;".to_string()), "\n".to_string()), " let mut module_release_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut relay_emit_nanos: u128 = 0;".to_string()), "\n".to_string()), " // The per-path refusal index is built ONCE here rather than per module: this loop is the".to_string()), "\n".to_string()), " // only place that knows a loop is about to happen, and the join it feeds was O(modules x".to_string()), "\n".to_string()), " // refusals) when each module scanned the refusal list for itself.".to_string()), "\n".to_string()), " let refusal_index = native_lane_file_refusal_index(context.file_refusals.clone());".to_string()), "\n".to_string()), " for entry in universe.modules.iter() {".to_string()), "\n".to_string()), " let prepare_started = Instant::now();".to_string()), "\n".to_string()), " let mut identities: usize = 0;".to_string()), "\n".to_string()), " let mut module_evaluate_nanos: u128 = 0;".to_string()), "\n".to_string()), " let mut module_infer_nanos: u128 = 0;".to_string()), "\n".to_string()), " // THE PREPARATION SPAN CLOSES WHEN THE PREPARATION OUTCOME IS ESTABLISHED, BEFORE ANY".to_string()), "\n".to_string()), " // DECLARATION IS EVALUATED. prepare and eval are exclusive rows of one partition, so a".to_string()), "\n".to_string()), " // prepare interval that contained its module's eval intervals would count that work".to_string()), "\n".to_string()), " // twice and inflate the sum against the parent.".to_string()), "\n".to_string()), " //".to_string()), "\n".to_string()), " // THE CLOSE IS THE ARM'S VALUE, NOT AN ASSIGNMENT INSIDE IT. Assigning an outer binding".to_string()), "\n".to_string()), " // from each arm left its initialiser dead, and a dead store is an ERROR in the emitted".to_string()), "\n".to_string()), " // crate (RUSTFLAGS=\"-D warnings\"); silencing it with an allow would be the escape hatch".to_string()), "\n".to_string()), " // DESIGN section 5 forbids. Each arm yields its own span instead, so there is one binding".to_string()), "\n".to_string()), " // site, nothing to overwrite, and the order control has a single spelling to assert on.".to_string()), "\n".to_string()), " let resolve_started = Instant::now();".to_string()), "\n".to_string()), " let resolution = native_lane_module_resolution(context.clone(), refusal_index.clone(), entry.clone());".to_string()), "\n".to_string()), " let module_resolve_nanos = span_nanos(resolve_started);".to_string()), "\n".to_string()), " let (outcome_label, module_prepare_nanos) = match &*resolution {".to_string()), "\n".to_string()), " NativeLaneModuleResolution::NativeLaneModuleContextRowsDecided { rows } => {".to_string()), "\n".to_string()), " let this_prepare = span_nanos(prepare_started);".to_string()), "\n".to_string()), " prepare_refused += 1;".to_string()), "\n".to_string()), " for row in rows.iter() {".to_string()), "\n".to_string()), " population.push(row.clone());".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"context_refused\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeLaneModuleResolution::NativeLaneModuleResolveRowsDecided { rows } => {".to_string()), "\n".to_string()), " let this_prepare = span_nanos(prepare_started);".to_string()), "\n".to_string()), " prepare_refused += 1;".to_string()), "\n".to_string()), " for row in rows.iter() {".to_string()), "\n".to_string()), " population.push(row.clone());".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"resolve_refused\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeLaneModuleResolution::NativeLaneModuleResolved { resolved } => {".to_string()), "\n".to_string()), " let infer_started = Instant::now();".to_string()), "\n".to_string()), " let preparation = native_lane_module_inference(entry.clone(), resolved.clone());".to_string()), "\n".to_string()), " module_infer_nanos = span_nanos(infer_started);".to_string()), "\n".to_string()), " let this_prepare = span_nanos(prepare_started);".to_string()), "\n".to_string()), " match &*preparation {".to_string()), "\n".to_string()), " NativeLaneModulePreparation::NativeLaneModuleRowsDecided { rows } => {".to_string()), "\n".to_string()), " prepare_refused += 1;".to_string()), "\n".to_string()), " for row in rows.iter() {".to_string()), "\n".to_string()), " population.push(row.clone());".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"infer_refused\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeLaneModulePreparation::NativeLaneModulePrepared { prepared } => {".to_string()), "\n".to_string()), " prepare_ok += 1;".to_string()), "\n".to_string()), " for declaration in entry.declarations.iter() {".to_string()), "\n".to_string()), " let evaluate_started = Instant::now();".to_string()), "\n".to_string()), " let row = native_lane_identity_row(".to_string()), "\n".to_string()), " prepared.clone(),".to_string()), "\n".to_string()), " entry.module.clone(),".to_string()), "\n".to_string()), " declaration.clone(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let this_eval = span_nanos(evaluate_started);".to_string()), "\n".to_string()), " module_evaluate_nanos += this_eval;".to_string()), "\n".to_string()), " eval_samples.push(this_eval);".to_string()), "\n".to_string()), " population.push(row);".to_string()), "\n".to_string()), " identities += 1;".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " (\"accepted\", this_prepare)".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " prepare_total_nanos += module_prepare_nanos;".to_string()), "\n".to_string()), " evaluate_total_nanos += module_evaluate_nanos;".to_string()), "\n".to_string()), " prepare_samples.push(module_prepare_nanos);".to_string()), "\n".to_string()), " // RELEASE IS MEASURED, NOT LEFT TO SCOPE EXIT. The resolved tree this module built is".to_string()), "\n".to_string()), " // dropped HERE, inside a span, because dropping it at the end of the iteration paid real".to_string()), "\n".to_string()), " // time that no exclusive row covered. An explicit drop makes the cost nameable; scope".to_string()), "\n".to_string()), " // exit hides it. What that cost turned out to BE -- and whether it explains anything --".to_string()), "\n".to_string()), " // is a fact of std.compiler_entry NativeDriverExclusiveRows, not of this template.".to_string()), "\n".to_string()), " let release_started = Instant::now();".to_string()), "\n".to_string()), " drop(resolution);".to_string()), "\n".to_string()), " module_release_nanos += span_nanos(release_started);".to_string()), "\n".to_string()), " // One stderr write per unique module, to a pipe the host runner drains. It is spanned".to_string()), "\n".to_string()), " // because it was paid inside parent_span with no exclusive row over it. What the span".to_string()), "\n".to_string()), " // has since MEASURED, and what the residual is, are facts of std.compiler_entry".to_string()), "\n".to_string()), " // NativeDriverExclusiveRows and are deliberately not restated here: a number copied".to_string()), "\n".to_string()), " // into a generated template rots in a place no fold can reach to correct it.".to_string()), "\n".to_string()), " let relay_started = Instant::now();".to_string()), "\n".to_string()), " eprintln!(\"[native-prepare-split] module={} resolve_nanos={module_resolve_nanos} infer_nanos={module_infer_nanos} prepare_nanos={module_prepare_nanos} decls={} outcome={outcome_label}\", entry.module, identities);".to_string()), "\n".to_string()), " relay_emit_nanos += span_nanos(relay_started);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // receipt_admission: minting the receipt and evaluating the authority's admission and summary".to_string()), "\n".to_string()), " // over it. The controls are executed here because they are receipt inputs, not universe members.".to_string()), "\n".to_string()), " let admission_started = Instant::now();".to_string()), "\n".to_string()), " let receipt = native_lane_receipt(".to_string()), "\n".to_string()), " context.clone(),".to_string()), "\n".to_string()), " universe.clone(),".to_string()), "\n".to_string()), " Rc::new(population.clone().into()),".to_string()), "\n".to_string()), " native_lane_controls(context.clone()),".to_string()), "\n".to_string()), " Rc::new(facts),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " let admission = native_route_admission(receipt.clone());".to_string()), "\n".to_string()), " let summary = native_route_admission_summary(admission.clone());".to_string()), "\n".to_string()), " let file_refusal_tally: Vec = native_route_file_refusal_tally(receipt.clone())".to_string()), "\n".to_string()), " .iter()".to_string()), "\n".to_string()), " .map(|row| serde_json::json!(row))".to_string()), "\n".to_string()), " .collect();".to_string()), "\n".to_string()), " let admitted = native_route_admitted(admission.clone());".to_string()), "\n".to_string()), " let admission_nanos = span_nanos(admission_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // row_serialization: SERIALIZING THE OBSERVATIONS AND WRITING THEM, MEASURED (review".to_string()), "\n".to_string()), " // 64181 named this span; #11105 made leaving it unattributed fatal). Every row the".to_string()), "\n".to_string()), " // population carries is turned into JSON here and written to stdout, which is real work".to_string()), "\n".to_string()), " // no other row covers -- eval is the identity fold and nothing else. It is TIMED, never".to_string()), "\n".to_string()), " // derived as parent minus the others: a row defined as the remainder would force the".to_string()), "\n".to_string()), " // residual to zero and make the tolerance arm unfireable by construction.".to_string()), "\n".to_string()), " let serialization_started = Instant::now();".to_string()), "\n".to_string()), " for refusal in receipt.file_refusals.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::json!({ \"file_refusal\": refusal }));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " for row in population.iter() {".to_string()), "\n".to_string()), " println!(\"{}\", serde_json::to_string(row).unwrap());".to_string()), "\n".to_string()), " // THE OPERATOR'S LINE, BESIDE THE PERSISTED ROW. The JSON above is the receipt; this is".to_string()), "\n".to_string()), " // the same value rendered by the authority for a reader of the command's output, so a".to_string()), "\n".to_string()), " // row that did not pass names its subject, stage, cause and position without anyone".to_string()), "\n".to_string()), " // re-deriving them from the bytes just written. Passing rows print nothing here: the".to_string()), "\n".to_string()), " // terminal marker carries their count. EXHAUSTIVE ON PURPOSE -- a verdict arm added to".to_string()), "\n".to_string()), " // the vocabulary must decide here whether it is operator-visible.".to_string()), "\n".to_string()), " match &*row.verdict {".to_string()), "\n".to_string()), " NativeTestVerdict::NativeTestPassed => {}".to_string()), "\n".to_string()), " NativeTestVerdict::NativeTestReturnedFalse".to_string()), "\n".to_string()), " | NativeTestVerdict::NativeTestReturnedOther".to_string()), "\n".to_string()), " | NativeTestVerdict::NativeTestRefused { .. } => {".to_string()), "\n".to_string()), " eprintln!(\"[native-verdict] {}\", native_route_member_row_text(row.clone()));".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let row_serialization_nanos = span_nanos(serialization_started);".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), " // THE PARTITION, THROUGH THE ONE LAW. The rows are the row set std.compiler_entry owns and".to_string()), "\n".to_string()), " // verdict is native_driver_cost_account over them -- not a second reconcile. The two rows".to_string()), "\n".to_string()), " // this route pays that a driver handed a universe file does not (universe_derivation,".to_string()), "\n".to_string()), " // receipt_admission) are members of the same exclusive sum, so an over-attribution through".to_string()), "\n".to_string()), " // either is caught here rather than by a check of its own.".to_string()), "\n".to_string()), " prepare_samples.sort_unstable();".to_string()), "\n".to_string()), " eval_samples.sort_unstable();".to_string()), "\n".to_string()), " let parent_span_nanos = span_nanos(driver_start);".to_string()), "\n".to_string()), " // THE DRIVER IS EXHAUSTIVE OVER THE KEY WITH NO WILDCARD, deliberately: a row added to".to_string()), "\n".to_string()), " // std.compiler_entry makes THIS match refuse to compile until the driver says what".to_string()), "\n".to_string()), " // measures it. A wildcard here would answer zero for a span nobody wired up, which is".to_string()), "\n".to_string()), " // the absorbing arm DESIGN section 5 forbids -- and it is what the old record literal".to_string()), "\n".to_string()), " // did silently, three folds running.".to_string()), "\n".to_string()), " let exclusive = native_driver_exclusive_rows(move |k| match k {".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveLoad => nanosecond(native_cost_i64(load_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveUniverseDerivation => nanosecond(native_cost_i64(universe_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveContext => nanosecond(native_cost_i64(context_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusivePrepare => nanosecond(native_cost_i64(prepare_total_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveEval => nanosecond(native_cost_i64(evaluate_total_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveReceiptAdmission => nanosecond(native_cost_i64(admission_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveRowSerialization => nanosecond(native_cost_i64(row_serialization_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveModuleRelease => nanosecond(native_cost_i64(module_release_nanos)),".to_string()), "\n".to_string()), " NativeDriverExclusiveRowKey::ExclusiveRelayEmit => nanosecond(native_cost_i64(relay_emit_nanos)),".to_string()), "\n".to_string()), " });".to_string()), "\n".to_string()), " let exclusive_sum = nanosecond_count(native_driver_exclusive_sum(exclusive.clone())) as u128;".to_string()), "\n".to_string()), " let tolerance_nanos = nanosecond_count(native_driver_cost_remainder_tolerance_nanos()) as u128;".to_string()), "\n".to_string()), " let accounting = native_driver_cost_account(".to_string()), "\n".to_string()), " nanosecond(native_cost_i64(parent_span_nanos)),".to_string()), "\n".to_string()), " exclusive.clone(),".to_string()), "\n".to_string()), " native_driver_cost_remainder_tolerance_nanos(),".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " // The remainder is the residual the accounting itself returns, never parent minus sum: on".to_string()), "\n".to_string()), " // over-attributed arm there IS no remainder, and a clamped zero there would be a".to_string()), "\n".to_string()), " // plausible number standing where the measurement is incoherent.".to_string()), "\n".to_string()), " let (verdict, remainder_nanos) = match accounting.as_ref() {".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostOverAttributed { .. } =>".to_string()), "\n".to_string()), " (r#\"NativeDriverCostOverAttributed\"#, serde_json::Value::Null),".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostRemainderExceedsTolerance { residual, .. } =>".to_string()), "\n".to_string()), " (r#\"NativeDriverCostRemainderExceedsTolerance\"#, serde_json::json!(nanosecond_count(residual.clone()))),".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostReconciled { residual, .. } =>".to_string()), "\n".to_string()), " (r#\"NativeDriverCostReconciled\"#, serde_json::json!(nanosecond_count(residual.clone()))),".to_string()), "\n".to_string()), " };".to_string()), "\n".to_string()), " let identities = universe.identities.len() as u64;".to_string()), "\n".to_string()), " let eval_mean = if eval_samples.is_empty() { 0 } else { evaluate_total_nanos / eval_samples.len() as u128 };".to_string()), "\n".to_string()), " let prepare_mean = if prepare_samples.is_empty() { 0 } else { prepare_total_nanos / prepare_samples.len() as u128 };".to_string()), "\n".to_string()), " // THE ROWS ARE PROJECTED FROM THE VALUE, NOT RE-LISTED (review 64181). The field names".to_string()), "\n".to_string()), " // were written once to build NativeDriverExclusiveRows and again to render it, which is the".to_string()), "\n".to_string()), " // second spelling this file warns about for prose, applied to the emitted object: a driver".to_string()), "\n".to_string()), " // gaining a phase would have updated the struct and left the receipt short. Serializing the".to_string()), "\n".to_string()), " // value carries the row set from the type, so the JSON cannot disagree with the fold. The".to_string()), "\n".to_string()), " // rows therefore render as std.measure Nanosecond objects rather than bare integers -- the".to_string()), "\n".to_string()), " // unit travels with the number, which is the point of the type.".to_string()), "\n".to_string()), " // A NON-RECONCILED ARM IS A PROCESS REFUSAL (#11105, review 63891). The receipt is".to_string()), "\n".to_string()), " // printed first so the numbers that caused the refusal are on the wire, and THEN the".to_string()), "\n".to_string()), " // line stops: a verdict string with exit 0 is the inert lens DESIGN section 6 names.".to_string()), "\n".to_string()), " // The full-N run of this route refused here on 158600186 ns against a 50000000 ns".to_string()), "\n".to_string()), " // tolerance before row_serialization was a measured row, which is what put that row on".to_string()), "\n".to_string()), " // the type rather than a wider tolerance on this arm.".to_string()), "\n".to_string()), " eprintln!(\"[native-cost-partition] {}\", serde_json::json!({".to_string()), "\n".to_string()), " \"basis\": \"native_driver_wall\",".to_string()), "\n".to_string()), " \"basis_note\": \"single-threaded SourceRootEvalDriver wall; exclusive rows partition parent_span_nanos\",".to_string()), "\n".to_string()), " \"producer\": \"std.compiler_entry.SourceRootEvalDriver\",".to_string()), "\n".to_string()), " \"head\": head,".to_string()), "\n".to_string()), " \"mode\": \"adjudicate\",".to_string()), "\n".to_string()), " \"verdict\": verdict,".to_string()), "\n".to_string()), " \"tolerance_nanos\": tolerance_nanos,".to_string()), "\n".to_string()), " \"parent_span_nanos\": parent_span_nanos,".to_string()), "\n".to_string()), " \"exclusive\": exclusive.rows.iter().map(|r| (".to_string()), "\n".to_string()), " native_driver_exclusive_row_name(r.key.clone()),".to_string()), "\n".to_string()), " serde_json::json!(r.nanos),".to_string()), "\n".to_string()), " )).collect::>(),".to_string()), "\n".to_string()), " \"sum_exclusive_nanos\": exclusive_sum,".to_string()), "\n".to_string()), " \"remainder_nanos\": remainder_nanos,".to_string()), "\n".to_string()), " \"corpus_reads\": corpus_reads,".to_string()), "\n".to_string()), " \"closure_reads\": closure_reads,".to_string()), "\n".to_string()), " \"scanned_paths\": ingest_receipt.scanned_paths.len(),".to_string()), "\n".to_string()), " \"ingested_paths\": ingest_receipt.ingested_paths.len(),".to_string()), "\n".to_string()), " \"closure_modules\": closure.len(),".to_string()), "\n".to_string()), " \"identities\": identities,".to_string()), "\n".to_string()), " \"unique_modules\": universe.modules.len(),".to_string()), "\n".to_string()), " \"file_refusals\": receipt.file_refusals.len(),".to_string()), "\n".to_string()), " \"prepare_ok\": prepare_ok,".to_string()), "\n".to_string()), " \"prepare_refused\": prepare_refused,".to_string()), "\n".to_string()), " \"prepare_mean_nanos\": prepare_mean,".to_string()), "\n".to_string()), " \"prepare_p50_nanos\": native_cost_quantile_nanos(&prepare_samples, 1, 2),".to_string()), "\n".to_string()), " \"prepare_p95_nanos\": native_cost_quantile_nanos(&prepare_samples, 19, 20),".to_string()), "\n".to_string()), " \"prepare_max_nanos\": prepare_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " \"eval_mean_nanos\": eval_mean,".to_string()), "\n".to_string()), " \"eval_p50_nanos\": native_cost_quantile_nanos(&eval_samples, 1, 2),".to_string()), "\n".to_string()), " \"eval_p95_nanos\": native_cost_quantile_nanos(&eval_samples, 19, 20),".to_string()), "\n".to_string()), " \"eval_max_nanos\": eval_samples.last().copied().unwrap_or(0),".to_string()), "\n".to_string()), " \"peak_rss_bytes\": proc_status_kib(\"VmHWM\").map(|kib| kib * 1024),".to_string()), "\n".to_string()), " \"rss_bytes\": proc_status_kib(\"VmRSS\").map(|kib| kib * 1024),".to_string()), "\n".to_string()), " }));".to_string()), "\n".to_string()), " match accounting.as_ref() {".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostReconciled { .. } => {}".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostOverAttributed { sum_exclusive, parent_span } => {".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"REFUSED: native driver cost OverAttributed {{ sum_exclusive_nanos: {}, parent_span_nanos: {} }}\",".to_string()), "\n".to_string()), " nanosecond_count(sum_exclusive.clone()) as u128,".to_string()), "\n".to_string()), " nanosecond_count(parent_span.clone()) as u128".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeDriverCostAccounting::NativeDriverCostRemainderExceedsTolerance { residual, tolerance } => {".to_string()), "\n".to_string()), " eprintln!(".to_string()), "\n".to_string()), " \"REFUSED: native driver cost RemainderExceedsTolerance {{ residual_nanos: {}, tolerance_nanos: {} }} -- unattributed driver work; name the span, do not widen the tolerance\",".to_string()), "\n".to_string()), " nanosecond_count(residual.clone()) as u128,".to_string()), "\n".to_string()), " nanosecond_count(tolerance.clone()) as u128".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " println!(".to_string()), "\n".to_string()), " \"{}\",".to_string()), "\n".to_string()), " serde_json::json!({".to_string()), "\n".to_string()), " \"_terminal\": \"complete\",".to_string()), "\n".to_string()), " \"mode\": \"adjudicate\",".to_string()), "\n".to_string()), " \"rows\": population.len(),".to_string()), "\n".to_string()), " \"universe\": universe.identities.len(),".to_string()), "\n".to_string()), " \"file_refusals\": receipt.file_refusals.len(),".to_string()), "\n".to_string()), " \"file_refusal_tally\": file_refusal_tally,".to_string()), "\n".to_string()), " \"admitted\": admitted,".to_string()), "\n".to_string()), " \"summary\": summary,".to_string()), "\n".to_string()), " })".to_string()), "\n".to_string()), " );".to_string()), "\n".to_string()), " if admitted {".to_string()), "\n".to_string()), " std::process::exit(0);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " std::process::exit(1);".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "".to_string()), "\n".to_string()), "fn main() {".to_string()), "\n".to_string()), " let argv: Vec = std::env::args().skip(1).collect();".to_string()), "\n".to_string()), " let plan = native_driver_parse(Rc::new(argv.into()));".to_string()), "\n".to_string()), " if let ProcessExit::ExitFailure { code, reason } = &*native_driver_plan_exit(plan.clone()) {".to_string()), "\n".to_string()), " eprintln!(\"{reason}\");".to_string()), "\n".to_string()), " std::process::exit(*code as i32);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " let source_roots: Vec = native_driver_plan_source_roots(plan.clone()).iter().cloned().collect();".to_string()), "\n".to_string()), " match &*plan {".to_string()), "\n".to_string()), " NativeDriverPlan::NativeDriverPlanRefused { reason, detail } => {".to_string()), "\n".to_string()), " eprintln!(\"REFUSED: native driver plan refused ({reason:?}) but its exit was success -- {detail}\");".to_string()), "\n".to_string()), " std::process::exit(70);".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " NativeDriverPlan::NativeDriverPlanned { verb } => {".to_string()), "\n".to_string()), " let verb: &NativeDriverVerb = verb;".to_string()), "\n".to_string()), " match verb {".to_string()), "\n".to_string()), " NativeDriverVerb::NativeDriverCensus { .. } => run_census(&source_roots),".to_string()), "\n".to_string()), " NativeDriverVerb::NativeDriverCensusResolve { .. } => run_census_resolve(&source_roots),".to_string()), "\n".to_string()), " NativeDriverVerb::NativeDriverAdjudicate { facts_path, pattern, .. } => run_adjudication(facts_path, Rc::new(TargetPattern::clone(pattern)), &source_roots),".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), " }".to_string()), "\n".to_string()), "}".to_string()), "\n".to_string()), "\n".to_string()), }) } } From 4f050c26457ad724cf31e108c516bc80396ad26f Mon Sep 17 00:00:00 2001 From: Brian Searls Date: Tue, 22 Sep 2026 07:30:33 +0000 Subject: [PATCH 8/9] review 70030: name the instrument, drop the transcribed digits DESIGN section 6: "Name the instrument, never transcribe its output ... a transcribed number is unreachable from the thing that owns it, so it rots without anyone touching either end." Both sites are lines this branch ADDED, so this is new rot rather than inherited. 00_compile.dag:1813 named no producer at all while carrying the figure the whole scoping decision rests on ("935 of 6484 corpus files"). It now names what re-derives the ratio: the adjudicating driver's terminal `universe` beside the `[native-cost-partition]` line's `corpus_reads`. 00_compile.dag:2276-2279 did name `[native-cost-partition]` and then copied 23.35 s, 121.4 s, corpus_reads 6482 and closure_reads 133 into prose. It now names the producer -- std.compiler_entry SourceRootEvalDriver's adjudicate mode -- and states the claim that survives without any digit: universe_derivation does not narrow with the pattern (corpus_reads stays at corpus scale while closure_reads tracks the selection) and was entered twice per run. The honesty the old note carried is kept verbatim: that figure is the OLD PHASE COST and NOT a saving demonstrated by this change, and what the saving is has to come from an integrated native run this change does not perform. Verified: the three field names cited are real and emitted by the driver (corpus_reads, closure_reads in 05_emit_rust; universe on the adjudicate terminal), so this replaces transcribed numbers with citations that resolve rather than with an invented symbol. Controls unchanged: native_lane_import_refusal_witness_test 23/23. Co-Authored-By: Claude Opus 5 (1M context) --- src/v2/compiler/00_compile.dag | 23 +++++++++++++++-------- 1 file changed, 15 insertions(+), 8 deletions(-) diff --git a/src/v2/compiler/00_compile.dag b/src/v2/compiler/00_compile.dag index c84462d4874..168c28db7f6 100644 --- a/src/v2/compiler/00_compile.dag +++ b/src/v2/compiler/00_compile.dag @@ -1810,8 +1810,10 @@ fn native_lane_source_facts(ingest: SourceRootIngest) -> List Outcome // incremental reduction with a boundary that is visible on purpose, not the focused path's final // shape. // -// MEASURED, on the first native run of a selected pattern (2026-09-21, seven identities of -// `v2.test.parse.expression_bodied_fn_decl_parse` at `//v2/test/parse/...:all`): the lane's own -// `[native-cost-partition]` receipt reports `universe_derivation` at 23.35 s of a 121.4 s wall, -// over `corpus_reads` 6482 while `closure_reads` was 133. That figure is the OLD PHASE COST, not a -// saving demonstrated by this change: it says the phase did not narrow with the pattern and was -// entered twice per run. What the saving actually is has to come from an integrated native run. +// THE INSTRUMENT IS NAMED AND ITS NUMBERS ARE NOT COPIED HERE (DESIGN section 6). The lane's own +// `[native-cost-partition]` receipt carries the `universe_derivation` span against the driver wall, +// and `corpus_reads` beside `closure_reads`, on any adjudicating run of a selected pattern -- the +// producer is `std.compiler_entry` `SourceRootEvalDriver`'s adjudicate mode, so the figures are +// re-derived by running it rather than read from this comment. +// +// WHAT THAT RECEIPT ESTABLISHES, which is a claim about SHAPE and survives without any digit: the +// `universe_derivation` phase does not narrow with the pattern -- `corpus_reads` stays at corpus +// scale while `closure_reads` tracks the selection -- and it was entered twice per run. That is the +// OLD PHASE COST and NOT a saving demonstrated by this change. What the saving actually is has to +// come from an integrated native run, which this change does not perform. // // The rendered adjudicate main binds `source_facts` for the closure derivation -- // `native_lane_closure_modules`, `native_lane_closure_ingest`, `native_lane_ingest_receipt` and From ff209701b5a3fe39ae93cced97e61f1dbacf7ed4 Mon Sep 17 00:00:00 2001 From: Brian Searls Date: Tue, 22 Sep 2026 08:08:03 +0000 Subject: [PATCH 9/9] review 70052: the fourth stale note, in the one file the three-note sweep missed `NativeLaneIngestReceipt`'s note justified the corpus-wide `scanned` population "because discovery is a floor authority whose subject is the corpus and a `test`-marked declaration outside a sidecar must still be found". After native_lane_discovery_for that clause is FALSE for this lane: a test-marked declaration in a non-member module is precisely what this lane no longer finds. It is handed to the required floor, which reaches the same floor_discovery_finalize_source_outcomes over the full inventory. The POPULATION is unchanged -- the header and import scans stay corpus-wide -- so only the REASON rotted. The surviving reason was already written one function up: those scans protect THIS LANE'S OWN CLOSURE COMPLETENESS, because a malformed import line in any module the closure walk can reach would silently narrow the closure. The note now states that and records what it replaced. This is the same class this branch renamed the_out_of_selection_source_is_discovered_not_refused to avoid -- a rationale asserting a guarantee the code just relinquished, staying green because no Accepted program can read it (DESIGN section 4c). The branch swept three such notes and missed this one, one file over. Controls unchanged: native_lane_import_refusal_witness_test 23/23. Co-Authored-By: Claude Opus 5 (1M context) --- src/v2/compiler/00_compile.dag | 13 +++++++++++-- 1 file changed, 11 insertions(+), 2 deletions(-) diff --git a/src/v2/compiler/00_compile.dag b/src/v2/compiler/00_compile.dag index 168c28db7f6..4351d0f6b8c 100644 --- a/src/v2/compiler/00_compile.dag +++ b/src/v2/compiler/00_compile.dag @@ -2776,8 +2776,17 @@ fn native_lane_closure_ingest( // timer improvement, and only a POPULATION with a discriminating RED catches it. // // TWO POPULATIONS, NAMED SEPARATELY BECAUSE THEY COST DIFFERENT THINGS. `scanned` is what the route -// OPENED for textual discovery — the corpus, because discovery is a floor authority whose subject -// is the corpus and a `test`-marked declaration outside a sidecar must still be found. `ingested` +// OPENED for textual discovery — still the corpus, and THE REASON IS NO LONGER THE ONE THIS NOTE +// USED TO GIVE. It read "because discovery is a floor authority whose subject is the corpus and a +// `test`-marked declaration outside a sidecar must still be found". That clause is now FALSE for +// this lane: after `native_lane_discovery_for`, a `test`-marked declaration in a non-member module +// is exactly what this lane no longer finds -- it is handed to the required floor, which reaches +// the same `floor_discovery_finalize_source_outcomes` over the full inventory. The population is +// unchanged; only the justification rotted, which is the stale-rationale tell this same change +// renames `the_out_of_selection_source_is_discovered_not_refused` to avoid one file over. THE +// SURVIVING REASON is the one stated at `native_lane_source_facts` above: the header and import +// scans stay corpus-wide to protect THIS LANE'S OWN CLOSURE COMPLETENESS, because a malformed +// import line in any module the closure walk can reach would silently narrow the closure. `ingested` // is what it TOKENIZED, PARSED AND FOLDED, and the acceptance is an identity join on that one: it // equals the transitive import closure of the universe's modules plus the controls' module, // exactly. The RED is a module OUTSIDE that closure, malformed or expensive, whose edits change