Skip to content

feat(miner): add mask() — RFC 0001 §6.2 step 2 - #10

Merged
jensholdgaard merged 1 commit into
mainfrom
feat/miner-mask-layer-rfc0001-step2
May 10, 2026
Merged

feat(miner): add mask() — RFC 0001 §6.2 step 2#10
jensholdgaard merged 1 commit into
mainfrom
feat/miner-mask-layer-rfc0001-step2

Conversation

@jensholdgaard

Copy link
Copy Markdown
Owner

Summary

Second Red → Green building block for the miner. Implements the
masking layer per RFC 0001 §4.2 / §6.2 step 2: a token classified
as a known shape is replaced with its type tag in the masked
sequence and captured as a typed parameter. The tree walk routes
against the type tag (per §4.2's modification of paper-Drain);
reconstruction (§6.6) walks the parallel typed_params to recover
the original line bytes.

What's in this PR

  • ParamType enum with all RFC §6.1 variants (Ip, Uuid,
    Num, Hex, Ts, Path, Str, Overflow). Only the first
    three have a mask() emitter in this PR; the others are
    reserved on the enum because the Parquet record schema (§6.1)
    is the data contract.
  • Masked<'a> { tokens, typed_params } position-preserving
    output (tokens.len() == input.len() always); zero per-token
    allocation, value: &'a str borrows directly from the input.
  • mask() walks the input slice once, applying classify()
    per token. Rule precedence is UUID > IPv4 > NUM (most
    specific first), so a 36-char UUID is not misclassified as
    NUM and a dotted quad is not parsed as a digits-and-dots
    NUM-shaped string.
  • Hand-rolled classifiers — no regex dep yet:
    • is_uuid — 8-4-4-4-12 hex digits with - separators.
    • is_ipv4 — four 0..=255 octets, leading-zero rejection.
    • is_num — integers with optional leading -.

What's not in this PR (deferred, with reason)

  • Hex / Ts / Path rules — need richer rule shapes than the
    hand-rolled classifiers; deferred to a future masking-rule PR
    that probably introduces the regex dep.
  • Str emitter — RFC §6.2 step 5b says Str is captured by
    template widening (when a previously-fixed literal becomes a
    wildcard slot), not by the mask pass. Belongs to the widening
    PR.
  • Overflow emitter — RFC §6.5 says Overflow is emitted by the
    per-parameter byte-limit check. Belongs to the byte-limit PR.
  • Per-tenant configurable rules — RFC §4.2 commits to
    configurable masking; this PR ships only the hardcoded default
    rule set. Configuration interface is a separate PR.

Tests (AAA-structured per the new policy starting this PR)

7 unit tests in mask.rs:

  • mask_matches_rfc_section_3_5_worked_example — anchor test
    pinning the implementation against the RFC's own §3.5 example
    (user 42 logged in from 10.0.0.1user <NUM> logged in from <IP>). Covers IP, NUM, multiple literals, and positional
    preservation in one assertion.
  • mask_classifies_uuid — UUID-specific path.
  • mask_classifies_negative_integer_as_num — signed handling.
  • mask_unrecognized_tokens_stay_literal — pure-literal negative
    test.
  • mask_typed_param_value_borrows_from_input — pointer-equality
    check that pins the lifetime contract: a bug calling
    .to_string() somewhere would still pass string-equality
    assertions but fail this.
  • is_ipv4_rejects_octet_above_255 / _rejects_leading_zero_octet
    — boundary cases on the parser that prevent silent
    over-acceptance.

Lifecycle

Per docs/verification.md §3 two-loop spec:

  • Outer loop (cargo test --all-features):
    10 passed, 28 ignored. New tests are 7 mask + 3 existing
    tokenize/regression. The 28 ignored stubs are unchanged.
  • Inner loop (cargo test --no-fail-fast -- --ignored):
    28 failed, unchanged.

This PR adds infrastructure that no §5 scenario directly exercises
yet. Per docs/verification.md §2.4 ("normative not exhaustive")
and §8's "Unit tests for tree operations" technique, mask() is
covered by unit tests now and will be exercised end-to-end by
future PRs that wire tokenizemask → tree descend → attach.
The §5 scenario count toward Green is unchanged at 1/29. RFC
0001 stays at status: red.

Invariant / hazard impact (CLAUDE.md §§3, 4)

  • §3.7 (per-tenant template trees). mask() is currently
    per-process (no tenant ID parameter). This is fine for the
    hardcoded default rule set; once per-tenant configurable rules
    land, the MaskingRules struct will be per-tenant.
  • H1 (template miner correctness). mask() precedence is
    documented and tested (UUID > IPv4 > NUM); silent
    misclassification is the hazard, the precedence test pins it.
  • H2 (parameter cardinality blowup). Not addressed yet —
    OVERFLOW emitter is the byte-limit PR's responsibility.

Test plan

  • cargo fmt --all --check clean
  • cargo clippy --all-targets --all-features -- -D warnings clean
  • cargo test --all-features — 10 passed, 28 ignored
  • mdbook build clean (no doc changes, but verified)

🤖 Generated with Claude Code

Copilot AI left a comment

Copy link
Copy Markdown
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Pull request overview

Implements the miner’s token masking layer (RFC 0001 §4.2 / §6.2 step 2): classifies tokens by shape and replaces matched tokens with <TYPE> placeholders while capturing the original token bytes as typed parameters for later reconstruction.

Changes:

  • Added mask module with ParamType, TypedParam, Masked, and mask() implementing UUID/IPv4/NUM masking with documented precedence.
  • Added hand-rolled classifiers (is_uuid, is_ipv4, is_num) and unit tests covering RFC example + boundary cases.
  • Exported the new mask module from ourios-miner crate root.

Reviewed changes

Copilot reviewed 2 out of 2 changed files in this pull request and generated no comments.

File Description
crates/ourios-miner/src/mask.rs Introduces masking types + mask() and classifiers, plus unit tests validating RFC behavior and edge cases.
crates/ourios-miner/src/lib.rs Exposes the new mask module publicly.

💡 Add Copilot custom instructions for smarter, more guided reviews. Learn how to get started.

Second Red → Green building block. Implements the masking layer
per RFC 0001 §4.2 / §6.2 step 2: a token classified as a known
shape is replaced with its type tag in the masked sequence and
captured as a typed parameter. Tree-routing keys against the type
tag (per §4.2's modification of paper-Drain); reconstruction
walks the parallel typed_params to recover the original line bytes.

Implementation (crates/ourios-miner/src/mask.rs):

- ParamType enum carries all RFC §6.1 variants (IP, UUID, NUM,
  HEX, TS, PATH, STR, OVERFLOW). The Parquet record schema is the
  data contract — the enum exists in full now even though only IP
  / UUID / NUM have a mask() emitter in this PR. STR is added by
  the future widening PR (§6.2 step 5b), OVERFLOW by the
  byte-limit PR (§6.5), HEX / TS / PATH by future masking-rule
  PRs.
- Masked<'a> { tokens: Vec<&'a str>, typed_params: Vec<TypedParam<'a>> }
  is position-preserving: tokens.len() == input.len() always.
  Each token is either the original (unmasked, borrowed) or the
  static type-tag string (masked). typed_params is in match order,
  one entry per masked position. Like tokenize, no per-token
  allocation — value: &'a str borrows directly from the input.
- mask() walks the input slice once, applying classify() per
  token. Rule precedence is UUID > IPv4 > NUM (most specific
  first), so a 36-char UUID is not misclassified as NUM and a
  dotted quad is not parsed as a digits-and-dots NUM-shaped
  string.
- Hand-rolled classifiers (no regex dep): is_uuid checks 8-4-4-4-
  12 hex digits with `-` separators (RFC 4122 textual); is_ipv4
  checks four dot-separated 0..=255 octets and rejects leading
  zeros (avoids colliding with zero-padded numeric fields);
  is_num is integers with optional leading `-`.

Tests (in mask.rs, AAA-structured per the new policy starting
this PR):

- mask_matches_rfc_section_3_5_worked_example — anchor test
  pinning the implementation against the RFC's own §3.5 example
  ("user 42 logged in from 10.0.0.1" → "user <NUM> logged in from
  <IP>"). Covers IP, NUM, multiple literals, and positional
  preservation in one shot.
- mask_classifies_uuid — UUID-specific path the §3.5 example
  doesn't exercise.
- mask_classifies_negative_integer_as_num — signed handling.
- mask_unrecognized_tokens_stay_literal — pure-literal negative
  test; pins typed_params is empty and tokens pass through.
- mask_typed_param_value_borrows_from_input — pointer-equality
  check that pins the lifetime contract: a bug calling
  .to_string() somewhere would still pass string-equality
  assertions but fail this.
- is_ipv4_rejects_octet_above_255 / _rejects_leading_zero_octet
  — boundary cases on the parser that prevent silent
  over-acceptance.

Lifecycle (per docs/verification.md §3 two-loop spec):

This PR adds infrastructure that no §5 scenario directly exercises
yet. Per docs/verification.md §2.4 ("normative not exhaustive")
and §8's "Unit tests for tree operations" technique, mask() is
covered by unit tests now and will be exercised end-to-end by
future PRs that wire tokenize → mask → tree descend → attach.
The §5 scenario count toward Green is unchanged at 1/29.

- Outer loop (cargo test --all-features):
    10 passed, 28 ignored
    (3 tokenize-related + 7 mask = 10; the 28 ignored stubs are
     unchanged — H1.1, H1.2, H1.3, H2.1, H2.2, H5.1, H5.2, H5.3,
     H7.1, H7.2, H7.3, H7.4 (12); §3.1.1, §3.1.2, §3.2.1, §3.2.2,
     §3.3.1, §3.5.1, §3.5.2, §3.7.1, §3.7.2 (9); RFC0001.1, .2,
     .4, .5, .6, .7, .8 (7))
- Inner loop (cargo test --no-fail-fast -- --ignored):
    28 failed, unchanged

RFC 0001 stays at status: red until the last #[ignore] comes off.

Verification (CLAUDE.md §6.6): cargo fmt clean, cargo clippy
clean (pedantic), cargo test passing (10 / 28 split), mdbook
build clean.

Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
@jensholdgaard
jensholdgaard force-pushed the feat/miner-mask-layer-rfc0001-step2 branch from d42dbbd to 8dbe88f Compare May 10, 2026 12:46
@jensholdgaard
jensholdgaard merged commit af46c91 into main May 10, 2026
7 checks passed
@jensholdgaard
jensholdgaard deleted the feat/miner-mask-layer-rfc0001-step2 branch May 10, 2026 12:47
jensholdgaard added a commit that referenced this pull request May 10, 2026
Pure-math primitives. No §5 stub flips, no cluster wiring —
both deferred to the cluster-integration PR that follows.

Implementation (crates/ourios-miner/src/sim_seq.rs):

- Token<'a> { Fixed(&'a str), Wildcard } encodes the
  per-position template alphabet. RFC §3.1 describes wildcards
  using the literal `<*>` notation, but a sentinel string risks
  collision (a log line containing the literal token `<*>`
  would be silently treated as a wildcard match) and obscures
  the type-level distinction between masking-time tags
  (`<UUID>`, `<NUM>`, ...) and widening-time wildcards.
  Token::Wildcard is the unambiguous representation; future
  widening code will produce Vec<Token<'a>> directly.
- sim_seq(line, template) -> f32 implements RFC §3.2 literally:
  (count of positions where t_i == τ_i or τ_i is <*>) / N.
  Returns a value in [0.0, 1.0]. Two preconditions enforced
  via assert! (release-mode too — silent truncation of a
  length-mismatched zip is a worse failure mode than a panic):
    * line.len() == template.len() — the Drain tree's length-N
      node selection guarantees this by construction; a stray
      caller bypassing the tree gets a loud failure rather
      than a silent truncation by zip.
    * line.is_empty() rejected — RFC §3.2 implies N ≥ 1; the
      empty case has no defined similarity (0/0).
- confidence_ratio(sim_seq, threshold) -> f32 implements RFC
  §6.3's confidence = simSeq / threshold. The ratio reframes
  scale-invariantly across tenants — confidence == 1.0 is
  always the clean-attach decision boundary regardless of the
  configured threshold (the substantive claim of RFC0001.4).
  Precondition: threshold > 0 (MinerConfig::try_new enforces
  threshold ∈ (0, 1] so any threshold sourced from a validated
  MinerConfig cannot trigger; a stray caller bypassing config
  validation gets a loud failure rather than +inf or NaN).

Implementation chose index-based iteration over .iter().zip()
.filter() to sidestep clippy's auto-deref reference-level
errors when comparing &&str against the inner &str of
Token::Fixed; the indexed form is also clearer about the
position-by-position semantics RFC §3.2 describes.

Why this PR ships sim_seq + confidence_ratio paired:

The functions form one tight unit per RFC §6.3 — confidence is
sim_seq normalised by threshold, both pure, both required by
the cluster-integration PR that follows. Bundling them keeps
the math primitives in one place; future widening / attach /
audit work won't need to revisit this file. This is the same
shape as PR #10 (mask) — pure infrastructure ahead of wiring.

What this PR is NOT:

- Not a §5 stub flip. RFC0001.4's normative wording is
  ingest-path/branch-oriented ("the line is ingested",
  "takes the clean-attach branch"); pure functions can't drive
  ingest, so the stub stays #[ignore]. The follow-up
  cluster-integration PR flips RFC0001.4, H1.1, and H5.1
  together.
- No widening logic — Token::Wildcard exists in the type system
  but no code path produces it yet; widening is the
  next-but-one PR.
- No cluster wiring — MinerCluster's exact-match HashMap
  lookup stays in place this round.

Tests (in sim_seq.rs, AAA-structured per the standing policy):

sim_seq:
- sim_seq_identical_sequences_return_one — fundamental case.
- sim_seq_wildcard_template_matches_anything — wildcard
  semantics (template Token::Wildcard at every position).
- sim_seq_partial_match_returns_correct_ratio — formula
  correctness on a 2/3 mixed match.
- sim_seq_matches_rfc_section_3_5_worked_example_c — anchor
  to the RFC's own §3.5 example, line C vs T_A: "in" vs "out"
  at position 3 yields 5/6 ≈ 0.833.
- sim_seq_panics_on_length_mismatch — precondition.
- sim_seq_panics_on_empty_inputs — precondition.

confidence_ratio:
- confidence_ratio_at_threshold_returns_one — RFC §6.3
  boundary: simSeq == threshold yields exactly 1.0.
- confidence_ratio_is_scale_invariant_across_tenants — the
  RFC0001.4 substantive math claim: same simSeq = 0.7 yields
  confidence 1.0 under threshold 0.7 and confidence 1.4 under
  threshold 0.5.
- confidence_ratio_panics_on_zero_threshold — precondition.

No §5 scenario IDs in the doc comments since no §5 scenario
is being flipped (greppability per docs/verification.md §2.3
remains correct); test names reference RFC sections in prose.

Lifecycle (per docs/verification.md §3 two-loop spec):

- Outer loop (cargo test --all-features):
    30 passed (was 21: + 9 sim_seq tests), 23 ignored
- Inner loop (cargo test --no-fail-fast -- --ignored):
    23 failed, unchanged
- §5 scenario count toward Green: 6/29, unchanged

RFC 0001 stays at status: red (23 stubs to go).

Verification (CLAUDE.md §6.6): cargo fmt clean, cargo clippy
clean (-D warnings, --all-targets --all-features), cargo test
passing (30 / 23 split), mdbook build clean.

Co-authored-by: Claude Opus 4.7 <noreply@anthropic.com>
jensholdgaard added a commit that referenced this pull request Jul 14, 2026
…run #21) (#528)

The §7 deferral's named condition is met: RFC 0033's v2 compressed
template map merged (#522) and comparative run #21 measured every pair
warm at 187,904 B acquisition vs the 513,862 B fold (§9.15). M_L2
freezes per channel, derived from the run record:

- processed (primary): M_L2 = 10 — measured 32.5–39.3× across §9.13
  runs #10#17, 37.3–45.1× on the post-artifact total.
- storage-side: a 1.1× floor, integer-exact as ourios × 11 ≤
  loki_storage × 10 (m_l2_storage_floor_tenths = 11). The
  post-artifact honest total (0 + 2,035,267 + 187,904 = 2,223,171 B)
  computes to 1.20–1.51× against the recorded Loki storage band; 1.1
  sits below the weakest point with margin for Loki's documented
  chunk-boundary wobble. A parity-plus floor, not a 10× claim — the
  write-side lever stays recorded, not chased.

Harness: frozen_gate_failures() gates the L2 pair on both channels in
the existing salvage ordering; scenario RFC0031.3 un-stubs green in
the .2/.4 style (boundary math + record-derived evidence, including
the pre-artifact total correctly failing the floor). The RFC 0033
§5.6 corpus acquisition gate (warm ≤ fold/2 when a warm pair exists)
also asserts in the dispatch run — fold from a cold pair when one
exists, one off-timed-path refold in the all-warm steady state,
loudly non-evaluable on refold failure. bytes_must_win_tenths carries
the sub-integer floor with the lgates honesty guards (zero ⇒ Invalid,
overflow fails closed on the correct side), unit-tested at the
boundaries.

M_L4 and F_L7 deferrals are untouched. Merge is gated on a fresh
dispatch (run #23) from this branch proving the new assertions pass.


Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

Co-authored-by: Claude Fable 5 <noreply@anthropic.com>
jensholdgaard added a commit that referenced this pull request Jul 16, 2026
… boundaries

Run #10's diagnostics (wired in the prior commit) confirmed the L4
query itself is well-formed and Loki answers it successfully — no
error, no chunk-fetch shortfall visible in the sampled response. That,
combined with runs #6-#10 all converging to a stable ~93-97% regardless
of poll deadline (300s/600s/900s all statistically indistinguishable),
rules out both a timing race and a malformed query.

The real mismatch: Loki's query_range evaluates a step-grid starting
exactly at `start` (start, start+step, ..., end), but Ourios's own
bucket(width) semantics are epoch-aligned (floor(ts/width)*width) —
`min_effective_time_unix_nano` (the corpus's raw earliest timestamp)
has no reason to already be a bucket-boundary multiple. Unless
(end - start) is an exact multiple of the bucket width, the step-grid
leaves a fractional sliver at the tail of the range with no evaluated
window covering it at all — real, ingested, settled data that's simply
never queried, independent of poll duration. That's exactly the shape
every run has shown.

Snap `start` down and `end` up to the nearest bucket-width boundary in
l4_pair_spec — costs nothing (no data exists outside [min, max] to
inflate the count) and guarantees the step-grid fully covers the range.

Verified: cargo fmt --all --check, workspace cargo clippy -D warnings,
local (non-container) rfc0031_comparative unit tests — 39 passed.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y
jensholdgaard added a commit that referenced this pull request Jul 16, 2026
Run #11 (bucket-aligned query window) measured 96.6% (11133/11523) —
narrower than the pre-fix ~93% plateau, but still in the same stable
band as runs #6-#10, all independent of poll deadline, entries-limit,
and now bucket alignment. Six straight dispatches without closing the
gap means continuing to guess at query-side LogQL/config knobs isn't
warranted anymore.

Added a decisive probe: on a deadline miss, loki_measure_frequency_pair
now also runs a PLAIN line-filter count (no count_over_time, no
regexp) for the same needle + window via the new
loki_query_range_uncapped (limit sized to expected_rows, unlike the
shared loki_query_range's fixed 5000 cap — which is below this pair's
11523 expected rows and would itself lie about the count). If that
plain count also falls short by the same margin, the shortfall is
ingest-side (Loki never stored those lines) and no further query
tuning will fix it; if it's ~complete, the loss is specific to the
aggregation path.

Diagnostic-only change — no behavior change to the measurement itself,
just evidence gathering on the existing failure path.

Verified: cargo fmt --all --check, workspace cargo clippy -D warnings,
local (non-container) rfc0031_comparative unit tests — 39 passed.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y
jensholdgaard added a commit that referenced this pull request Jul 17, 2026
* feat(bench): rfc 0031 l4 — wire into the live dispatch loop

Live-wires PairClass::L4 into rfc0031_indicative_comparative_run, the
#[ignore]d container-based dispatch test. The previous slice proved
the L4 machinery (ourios_aggregate_answer, parse_loki_matrix,
pick_frequency_pair, compare_aggregations) only at the fixture level,
against a hand-built Loki matrix response — this slice makes it real
against a running Loki container and the actual corpus.

L4 is picked and measured as its own step, kept OUT of the
`Picks`/`specs: Vec<PairSpec>` pipeline the L1/L2/L3/L6 classes share:
an aggregation's (bucket, group) -> count map is not a LineKey
multiset, and forcing it through OuriosAnswer/compare_lines would
misrepresent the state rather than model it (the same "make invalid
states unrepresentable" reasoning the miner/parquet layers already
follow). Concretely: pick_frequency_pair runs post-store-build like
pick_template_pair; its PairSpec is built with the exact dsl/logql
shape the fixture-level test already pinned; loki_query_matrix issues
a real query_range metric call with `step` pinned to the bucket
width so evaluation instants land on parse_loki_matrix's documented
bucket-alignment convention (t = bucket_start + width);
loki_measure_frequency_pair polls it to completeness the same way
loki_measure_pair does for line-returning pairs. Both share the same
Loki container and corpus replay as the existing pairs.

Equivalence-required-but-bytes-unasserted: RFC0031.1 (result-set
equivalence) is never optional, so run_l4_pair asserts
compare_aggregations(...).is_equal() unconditionally — an L4 mismatch
fails the run exactly like every other class's equivalence check. Only
the bytes RATIO stays unasserted (M_L4 is still §7-DEFERRED, no frozen
margin to gate against yet): print_l4_report reuses
print_pair_bytes_gates, which already prints L4's ratio with no
verdict. L4 is measured, equivalence-checked, and reported LAST — after
the L1-L3/L6 evidence has printed and their frozen gates have already
asserted — so an L4-only failure cannot destroy that evidence (the same
run #11 salvage lesson the rest of the harness follows). A missing
candidate is reported loudly at pick time, never silently skipped.

Purely additive: class_pair_specs, build_pair_specs, frozen_gate_failures,
print_pair_bytes_gates, print_indicative_report, PairSpec, and PairClass
are unchanged — no frozen-gate behavior for L1/L2/L3/L6 is touched.

Verification: cargo fmt --all --check, cargo clippy --all-targets
--all-features -- -D warnings (workspace), cargo nextest run -p
ourios-bench (165 passed, 7 skipped) and cargo test -p ourios-bench
--all-features all green, including the untouched fixture-level
rfc0031_5_l4_frequency_aggregation_bytes. The corpus-scale dispatch
test itself needs Docker + OURIOS_COMPARATIVE_CORPUS, neither available
in this sandbox — its first live proof is the comparative-bench
dispatch workflow, same as every other slice in this harness's history.

Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* fix(bench): rfc 0031 l4 — backtick-delimit the loki regexp argument

The dispatch's first-ever run failed: capture_regex's own Go RE2
escapes (\s+, \S+) were embedded inside a double-quoted LogQL string
literal, which tried to interpret those backslashes as its own escape
sequences (\s is not a valid one) and Loki rejected the query with
"invalid char escape" before the pattern reached the regex engine.
Fixed by switching to a backtick-delimited (LogQL/Go raw string)
regexp argument, which passes the pattern through literally.

Extracted the duplicated PairSpec-construction block (present
independently in the fixture test and the live-wiring loop) into one
shared l4_pair_spec helper, closing the drift risk and centralizing
the fix. Added a backtick guard: a capture_regex containing a
backtick (regex_escape does not escape backticks) would prematurely
close the raw string, so the candidate is now rejected loudly instead
of emitting a malformed query.

Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* fix(bench): rfc 0031 l4 — measure L4 before, not after, the L1-L6 failure asserts

The second dispatch run failed on the pre-existing, documented L3
Loki-side flake (0 of 9 rows before timeout) — but the run never even
attempted L4: the failures.is_empty() assert for L1-L6's own salvaged
measurement failures sat textually BEFORE the L4 measurement/report
code, so any earlier pair's failure aborted the test before L4 was
ever reached. This inverted the design intent (an L4-only failure
should not destroy L1-L6 evidence, not the other way around).

Moved L4's measurement to run immediately after the report prints,
before the gate/failures assertions. run_l4_pair now pushes a Loki-side
measurement failure (flake) into the same failures vec the other
classes salvage into, instead of panicking immediately — so a flaky
L4 measurement no longer aborts before the L1-L6 evidence is captured,
symmetric with the fix for the reverse direction. A genuine L4
equivalence MISMATCH still hard-panics immediately, unchanged:
RFC0031.1 equivalence is never optional, matching L1-L6's own
compare_lines assertion.

Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* fix(bench): rfc 0031 l4 — cap the picker's row-count ceiling at 100K

The third dispatch got past the control-flow fix and genuinely
measured L4 — but the picked candidate (a service's dominant,
near-catch-all template) summed to ~971K matching rows, and Loki
returned only 811,775 of them before the 300s poll deadline (the
same budget every other class's loki_measure_pair uses). L4_MIN_ROWS
was a floor with no ceiling, so the picker had no reason to prefer a
smaller, still-meaningful candidate. Added L4_MAX_ROWS=100_000
(comfortable margin at the observed ~2.7K rows/s Loki throughput) to
frequency_shape_rejection, so the picker moves on to a candidate the
poll can actually finish measuring.

Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* fix(bench): rfc 0031 l4 — disable loki's query-range results cache

Run #4's L4 pair plateaued at 11,053/11,523 rows across every 10s poll
instead of climbing to completeness. The picker's row ceiling (run #3's
fix) had already ruled out "too large to finish in time" — the count
never moved at all, which points at a cache serving the same stale
answer on every retry rather than a slow ingest.

Loki's bundled local-config.yaml enables the embedded results cache for
query_range's metric/matrix path (L4's loki_query_matrix), keyed by the
query+start+end+step tuple that loki_measure_frequency_pair repolls
unchanged. The first (still-incomplete) response gets cached and echoed
back on every subsequent poll. Plain log queries (loki_query_range, used
by L1-L3/L6) aren't extent-cached the same way, so they self-heal across
polls untouched by this.

-query-range.cache-results=false trades Loki's own query latency for
correctness of the harness's completeness poll — in Loki's favour, same
as the other operator-tuning flags already on this container.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* fix(bench): rfc 0031 l4 — correct the results-cache disable flag name

Run #5 never got past container startup: `-query-range.cache-results`
doesn't exist ("flag provided but not defined"), so Loki's /ready check
timed out on a container that failed to start at all.

Checked the pinned v3.5.3 source directly instead of guessing again:
queryrangebase.Config.CacheResults is registered under the `querier.`
flag prefix in roundtrip.go, not `query-range.`. Correct flag is
-querier.cache-results=false.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* fix(bench): rfc 0031 l4 — widen the loki poll deadline to 900s

Run #6 (with the corrected -querier.cache-results=false flag from the
prior commit) proved the results-cache theory wrong: L1-L3/L6 all
measured cleanly, but L4 still plateaued — 10752/11523 rows (93.3%),
even slightly worse than run #4's 95.9% pre-fix, and the shortfall
varies run to run rather than repeating a fixed cached answer.

That points at genuine, variable completion time rather than a bug:
L4's LogQL runs a `| regexp` capture over every candidate line before
grouping and counting, a real per-line cost the other classes' plain
stream/count queries never pay. Widened loki_measure_frequency_pair's
deadline from 300s to 900s — well inside the CI job's unset (360 min
default) timeout given the whole run has taken ~95-100 min so far.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* fix(bench): rfc 0031 l4 — raise loki's max-entries-limit, revert deadline theory

Runs #4/#6/#7 all converged L4 to ~93-96% of expected rows, independent
of poll deadline (300s vs 900s made no measurable difference) — ruling
out both a results-cache echo (already disabled in #fe5915a) and a
"just needs more time" theory (the deadline widening from the prior
commit). A stable, time-independent shortfall points at something being
permanently excluded, not merely delayed.

Pulled the frozen otel-demo-v8 corpus locally and checked every log line
matching the L4 pair's needle ("Wrote producer snapshot at offset")
against its capture regex directly: all 11,525 matches parse cleanly.
The regex/content isn't the problem — some matching lines are never
being scanned at all.

That points at Loki's default -validation.max-entries-limit (5000):
count_over_time with a |regexp stage has to scan every raw kafka log
line in a query-frontend split before the line filter narrows it down,
and kafka's per-split volume exceeds 5000 lines often enough to
silently truncate the scan before every matching line is reached.
Raised the limit well past the corpus's noisiest single template's
volume (~971K rows).

Reverted the 900s deadline back to 300s (matching loki_measure_pair) —
the widened deadline never addressed the actual bottleneck, and keeping
it would misattribute the fix in a way that'd mislead the next reader.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* fix(bench): rfc 0031 l4 — widen poll deadline now the entries cap is gone

Run #8 (max-entries-limit raised) moved L4 from a hard ~93% plateau to
97.1% (11192/11523) — real progress, and unlike runs #4/#6/#7 the
remaining gap now plausibly behaves like genuine ingest settle time
rather than a fixed ceiling, since the artificial cap that made the
prior 300s vs 900s test inconclusive is gone. Widened the deadline to
600s to test that directly before assuming a third factor is at play.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* fix(bench): rfc 0031 l4 — revert unhelpful deadline widening, add diagnostics

Run #9 (600s) measured 96.5% (11123/11523), statistically the same as
run #8's 97.1% at 300s — deadline widening does nothing here, so the
remaining shortfall after the entries-limit fix is a second stable
cap, not settle time. Reverted the deadline back to 300s to match
loki_measure_pair rather than keep an unjustified change.

Wired the existing dump_loki_diagnostics helper (already used by
loki_measure_pair on a deadline miss) into loki_measure_frequency_pair
too — it's built around spec.logql + stats parsing, which is
query-shape-agnostic, so it works unmodified for the matrix path. If
L4 still falls short, the next run's failure carries the raw Loki
stats (chunk-fetch counts, any warnings) instead of another guess.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* fix(bench): rfc 0031 l4 — epoch-align the loki query window to bucket boundaries

Run #10's diagnostics (wired in the prior commit) confirmed the L4
query itself is well-formed and Loki answers it successfully — no
error, no chunk-fetch shortfall visible in the sampled response. That,
combined with runs #6-#10 all converging to a stable ~93-97% regardless
of poll deadline (300s/600s/900s all statistically indistinguishable),
rules out both a timing race and a malformed query.

The real mismatch: Loki's query_range evaluates a step-grid starting
exactly at `start` (start, start+step, ..., end), but Ourios's own
bucket(width) semantics are epoch-aligned (floor(ts/width)*width) —
`min_effective_time_unix_nano` (the corpus's raw earliest timestamp)
has no reason to already be a bucket-boundary multiple. Unless
(end - start) is an exact multiple of the bucket width, the step-grid
leaves a fractional sliver at the tail of the range with no evaluated
window covering it at all — real, ingested, settled data that's simply
never queried, independent of poll duration. That's exactly the shape
every run has shown.

Snap `start` down and `end` up to the nearest bucket-width boundary in
l4_pair_spec — costs nothing (no data exists outside [min, max] to
inflate the count) and guarantees the step-grid fully covers the range.

Verified: cargo fmt --all --check, workspace cargo clippy -D warnings,
local (non-container) rfc0031_comparative unit tests — 39 passed.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* diag(bench): rfc 0031 l4 — add an ingest-vs-query-side split probe

Run #11 (bucket-aligned query window) measured 96.6% (11133/11523) —
narrower than the pre-fix ~93% plateau, but still in the same stable
band as runs #6-#10, all independent of poll deadline, entries-limit,
and now bucket alignment. Six straight dispatches without closing the
gap means continuing to guess at query-side LogQL/config knobs isn't
warranted anymore.

Added a decisive probe: on a deadline miss, loki_measure_frequency_pair
now also runs a PLAIN line-filter count (no count_over_time, no
regexp) for the same needle + window via the new
loki_query_range_uncapped (limit sized to expected_rows, unlike the
shared loki_query_range's fixed 5000 cap — which is below this pair's
11523 expected rows and would itself lie about the count). If that
plain count also falls short by the same margin, the shortfall is
ingest-side (Loki never stored those lines) and no further query
tuning will fix it; if it's ~complete, the loss is specific to the
aggregation path.

Diagnostic-only change — no behavior change to the measurement itself,
just evidence gathering on the existing failure path.

Verified: cargo fmt --all --check, workspace cargo clippy -D warnings,
local (non-container) rfc0031_comparative unit tests — 39 passed.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* fix(bench): rfc 0031 l4 — reject high-frequency candidates prone to loki dedup

Run #12's decisive diagnostic confirmed the L4 shortfall is ingest-side:
a plain unaggregated line-filter count for the same needle+window came
back just as short (11160/11523) as every aggregation-path attempt.
Loki's ingester silently drops a log entry that collides with another
on (timestamp, body) within the same stream — a drop invisible to the
OTLP push response's partial_success (push_otlp already asserts that
field is clean on every push in every run so far). No query-side fix
was ever going to close this gap; the picker was choosing a candidate
Loki structurally can't ingest identically.

kafka's template_id=16 ("Wrote producer snapshot") fires roughly every
15s. A local exploration against the real frozen corpus (offline, no
Loki container — pick_frequency_pair only touches Ourios's own
pipeline) found candidates at much lower frequency clear of the same
floors: template_id=60 ("Periodic task") at ~144s average cadence, ~10x
the failing candidate's margin.

Added L4_MIN_AVG_INTERVAL_SECONDS (100s) to frequency_shape_rejection
as a durable picker rule, not a one-off override — this protects any
future re-run of the picker against landing on another collision-prone
high-frequency template, not just this specific dispatch.

Updated two pre-existing tests (pick_frequency_pair_finds_a_moderate_
cardinality_group, rfc0031_5_l4_frequency_aggregation_bytes) whose
synthetic sub-3s timelines — convenient for test speed, not meant to
model real timing risk — tripped the new floor; scaled their
timestamps 1000x (preserving cardinality/row-count/needle assertions
unchanged) so they represent a realistic, non-collision-prone example.

Verified: cargo fmt --all --check, workspace cargo clippy -D warnings,
local (non-container) rfc0031_comparative unit tests — 40 passed
(39 prior + 1 new: frequency_shape_rejection_enforces_the_average_
interval_floor).

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* diag(bench): rfc 0031 l4 — dump loki's own container logs on a deadline miss

Run #13's lower-frequency candidate (template_id=60, ~144s average
cadence) still fell short (1144/1197), and a corpus-side check ruled
out the leading theory entirely: every one of the 1197 matching
records has a UNIQUE timestamp AND a unique body (verified via jq
against the frozen otel-demo-v8 corpus locally) — zero exact
(timestamp, body) collisions possible. Loki's documented dedup rule
cannot be the mechanism here, which means it likely wasn't the full
story for the prior candidate either, even though lowering the
frequency floor did measurably help (17.5% loss -> 4.4% loss).

Also checked push_corpus_to_loki/push_otlp end to end for a harness-
side drop: the batching loop appends every non-empty corpus line's
resource_logs to `pending` before any flush, with a final flush after
the read loop — no line is skippable, and push_otlp's retry resends
the identical Bytes payload, so no bug found there either.

Everything checkable from the client side (query responses, corpus
content, our own push code) is now ruled out or confirmed clean. The
next place to look is Loki itself: on a deadline miss,
loki_measure_frequency_pair now also dumps the Loki container's own
stderr, filtered to warn/error/drop/reject/rate-limit/stream-limit
lines — the ingester logs these for exactly the mechanisms still on
the table (rate limiting, out-of-order rejection, stream-limit drops),
none of which are visible in a query response or push_otlp's already-
clean partial_success check.

Diagnostic-only — no change to measurement behavior.

Verified: cargo fmt --all --check, workspace cargo clippy -D warnings,
local (non-container) rfc0031_comparative unit tests — 40 passed.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* diag(bench): rfc 0031 l4 — scrape loki's discarded-samples metrics

Run #14's level=warn/level=error stderr scan came back with zero
matches in 6618 total lines — whatever is causing the L4 shortfall
(still 1147/1197 with the lower-frequency candidate), Loki doesn't
consider it log-worthy. That rules out rate limiting, out-of-order
rejection, and stream-limit drops as commonly logged at WARN.

(The first attempt at the stderr filter was a naive "contains warn"
substring match, which drowned in false positives from query text
like `severity_text="WARN"` appearing inside level=info lines — fixed
to match on the `level=` field precisely.)

Loki's distributor increments loki_discarded_samples_total/
loki_discarded_bytes_total (labeled by reason) even for discards that
don't warrant a log line — its own dedicated counter for exactly this
question. Added dump_loki_discard_metrics, scraping /metrics on a
deadline miss (extracted as its own function, alongside
dump_loki_diagnostics, to keep loki_measure_frequency_pair under
clippy's line-count lint).

Diagnostic-only — no change to measurement behavior.

Verified: cargo fmt --all --check, workspace cargo clippy -D warnings,
local (non-container) rfc0031_comparative unit tests — 40 passed.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* feat(bench): rfc 0031 l4 — documented completeness margin (§7, 2026-07-17)

Sixteen dispatches (runs #1-#16) exhausted every mechanism checkable
from the harness's side without ever reaching exact L4 completeness.
Runs #13-#16, specifically, ruled out: query-shape artifacts (a plain
line-filter count matched the aggregation-path shortfall exactly),
Loki's documented same-(timestamp,body) dedup (zero exact collisions
found via direct corpus analysis), interleaving between a genuine
mid-corpus kafka restart's two service-instance periods (cleanly
sequential), a harness-side push/batching bug (read end to end, none
found), anything Loki logs at WARN/ERROR (zero matches bar one
harmless startup transient), and Loki's own discarded-samples
Prometheus accounting (zero discards of any kind, any reason).

This matches an open, unresolved upstream Loki issue
(grafana/loki#10658 and related): wide-time-range queries silently
missing a small, consistent percentage of lines, with no error, no
discard signal, and no maintainer-identified root cause. It's a
documented, external, currently-unfixable characteristic of the
comparison partner, not an Ourios or harness defect.

Adds L4_COMPLETENESS_MARGIN = 0.90 (real headroom over the observed
3.9-4.4% loss band) and compare_aggregations_within_margin — narrowly
scoped: it still hard-fails, at any margin, on Loki reporting MORE
than Ourios for any cell or a cell absent from Ourios's own answer,
the two signals that would actually indicate a correctness bug. Only
aggregate under-counting up to the margin is tolerated.
compare_aggregations (exact) is untouched and still gates the
RFC0031.5 fixture-level test's synthetic Loki answer.

Wires the margin into both loki_measure_frequency_pair's poll-complete
threshold (accept short-of-exact within margin instead of always
retrying to a hard timeout) and run_l4_pair's equivalence assertion.

RFC 0031 amended: RFC0031.1's L4 clause now states the margin
explicitly, and §7's L4-query-shape entry (previously open) is closed
with the full evidence trail and the margin decision. M_L4 (bytes-read)
stays deferred — this unblocks a measurement, it doesn't freeze that
margin.

Verified: cargo fmt --all --check, workspace cargo clippy -D warnings,
ourios-bench lib tests (32 passed, comparative module) + local
rfc0031_comparative integration tests (40 passed), mdbook build.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* fix(bench): rfc 0031 l4 — margin check is total-level, not per-cell

Run #17 validated the completeness-margin design and immediately
refined it: the poll-completion check passed cleanly (1153/1197,
96.3%), but the equivalence check then hard-failed on a single cell
landing 1 row OVER Ourios's count (114 vs 113 for one bucket/value)
while the aggregate total stayed a solid under-count — consistent
with the same step-grid boundary imprecision already characterized
(a record landing in an adjacent bucket), not fabrication.

The original compare_aggregations_within_margin checked "Loki > Ourios"
per cell, which was too strict for that kind of noise. Refined to
check for phantom cells (a (bucket, group_key) Loki reports that
Ourios's own answer doesn't contain at all) and Loki's TOTAL exceeding
Ourios's total instead — this still catches the failure mode that
would actually indicate a bug (wrong regex or wrong bucket math would
produce cells Ourios never produced at all, or push the total over)
while tolerating single-cell boundary noise on keys both systems agree
exist.

Added a test for the exact run #17 shape (a single cell over, total
still under, must pass) alongside the existing phantom-cell and
net-overcount tests (renamed from "overcount" now that the check is
total-level). RFC 0031 §7's L4 entry updated with the refinement and
its rationale.

Verified: cargo fmt --all --check, workspace cargo clippy -D warnings,
ourios-bench lib tests (33 passed, +1 new) + local rfc0031_comparative
integration tests (40 passed), mdbook build.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* fix(bench): rfc 0031 l4 — per-group_key margin, address PR #536 review

PR #536's code review (14 fresh findings across Copilot + CodeRabbit's
post-run-18 passes) surfaced one substantive correctness gap and
several real documentation/robustness issues in the completeness-
margin work. All verified against current code before fixing.

Substantive fix — cross-key redistribution gap (CodeRabbit, Major):
compare_aggregations_within_margin's grand-total-only check (from the
run #17 fix) let Loki over-count one group_key while under-counting
another by the same amount and still read as 100% complete: Ourios
{A: 100, B: 100} vs Loki {A: 190, B: 10} sums to a "complete" 200/200
while hiding A being fabricated to compensate for B being nearly
lost. Refined to aggregate ourios/loki BY group_key first (summing
each key across every bucket it appears in), then apply the
phantom/overcount/margin checks per-key. This still tolerates run
#17's exact shape (a single bucket's +1 doesn't change a key's own
total across its buckets) while rejecting the redistribution a pure
grand-total check missed. Added regression tests for both shapes.

Also populates real per-key examples in mismatch reports (Copilot: the
old design returned examples: Vec::new() on both mismatch paths,
despite the function accepting examples_cap and RFC0031.1 calling for
example keys on a failed comparison).

Documentation/robustness fixes (all verified against current code,
none required a runtime-behavior change beyond the fix above):
- Two stale comments still asserted Loki's same-(timestamp, body)
  ingester dedup as the shortfall's mechanism, contradicting the
  nearby docs that say this was directly disproven and the true
  mechanism is uncharacterized (Copilot, 6 threads pointing at 2 real
  sites: the frequency_shape_rejection rejection message and one test
  comment — the other 4 threads were already-accurate historical
  narrative, verified and left alone).
- Missing `//` justification comment on one #[allow(cast_precision_loss)]
  (CodeRabbit).
- L4 picker silently continues when no viable candidate exists
  (l4_spec.is_none()) — only an eprintln, no run failure, despite L4
  being a must-win class (CodeRabbit). Now pushes into `failures`.
- PR description inaccurately described L4's equivalence assertion
  (exact compare_aggregations, ordered after the frozen gates) —
  rewritten to match actual behavior (margin-based, before the frozen
  gates, matching the run #11 salvage design already documented inline).
- RFC 0031 §7's L4 entry claimed the picker "prefers the lowest-
  frequency viable candidate" — the actual algorithm is first-fit in
  ascending (template_id, param) order, not an exhaustive ranking
  (CodeRabbit, tagged Heavy Lift). Reworded to describe actual
  behavior and the deliberate scope decision (a real ranking pass
  would cost a query per candidate against a corpus with tens of
  thousands of templates; not built given first-fit has now found a
  validated candidate three real dispatches running).
- Double-backtick delimiters for a LogQL code span containing literal
  backticks (CodeRabbit, MD038).

Verified: cargo fmt --all --check, workspace cargo clippy -D warnings,
ourios-bench lib tests (34 passed, +2 new) + local rfc0031_comparative
integration tests (40 passed), mdbook build.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* fix(bench): rfc 0031 l4 — absolute row tolerance, not pure percentage

Run #19 (the verification dispatch for the round-1 review fixes) found
a real edge case in the per-group_key percentage margin: a group_key
with exactly 1 total Ourios row, where Loki captured 0 (0%). A pure
ratio has no meaningful middle ground at n=1 — it's binary, 0% or
100% — yet losing one isolated occurrence is fully consistent with
the already-characterized ~4-8% aggregate loss rate this whole margin
exists to tolerate.

Converted the per-key check from a ratio (loki/ourios >= margin) to an
absolute row tolerance floored at 1: ceil(ourios_key_total *
(1 - margin)).max(1). This tolerates a cardinality-1 key losing its
only row while still catching a real shortfall on a large key (100
rows, tolerance 10, losing 20 still rejects) — the phantom-cell and
per-key-overcount hard-fail checks are unaffected. Two new regression
tests cover both ends.

Verified: cargo fmt --all --check, workspace cargo clippy -D warnings,
ourios-bench lib tests (36 passed, +2 new) + local rfc0031_comparative
integration tests (40 passed), mdbook build.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* fix(bench): rfc 0031 l4 — margin comparator precision, review triage

compare_aggregations_within_margin's tolerance formula (ceil(o*(1-margin))
.max(1)) was itself miscalibrated for small-but-not-1 totals, per two
independent Copilot review threads (o=2 at 90%: tolerance=1 permits 50%
completeness, not 90%). Replace the subtract-then-round row tolerance
with a direct, epsilon-guarded comparison — loki_total >= ourios_total *
margin — which also sidesteps a second bug the naive floor() fix
introduced: 1.0 - 0.9 isn't exactly 0.1 in f64, so floor(40.0 * (1.0 -
0.9)) truncated to 3 instead of 4, tightening the tolerance at exact
90%-boundary cases (caught by the existing
margin_comparison_tolerates_undercount_within_margin test's svcB case).

Extract phantom_cells and aggregate_by_group_key helpers to bring the
function back under clippy's line limit, and add a # Panics section for
the margin-validation assert.

Fix several accumulated PR #536 review findings: run_l4_pair's doc
comment claimed L4 runs after the L1-L3/L6 frozen gates assert (it
actually runs before, printing first); three "ingest-vs-query" overclaims
(the plain line-filter probe still calls query_range, so it can rule out
"specific to the metric-aggregation path" but not prove ingest-side
loss); L4_COMPLETENESS_MARGIN's own doc comment still described the
superseded total-level design. Add a clarifying comment on l4_pair_spec's
step-grid reasoning (the first evaluated instant decodes to an empty
phantom bucket, not a lost real one) and fix the RFC's LogQL code span,
which kept the backslash escaping needed for single backticks even after
switching to a double-backtick delimiter that makes it unnecessary.
Reconcile RFC0031.5's must-win predicate with M_L4 staying deferred —
add a note that the predicate is the target contract, not currently
gated.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* fix(bench): rfc 0031 l4 — panic-safe diagnostic probe, more review triage

loki_query_range_uncapped used expect()/assert!() internally, but it
runs on the L4 deadline-miss diagnostic path inside the same
runtime.block_on that gathers L1-L3/L6's evidence — a panic there
(a real Loki error response, a malformed body) would unwind the whole
async block and lose all of it, defeating the print-before-assert
salvage design (Copilot). Converted to return Result<u64, String>
instead of panicking, matching the already-panic-free sibling
diagnostics (dump_loki_diagnostics et al.).

Also: fix a test comment that said "one row under the ceiling" for a
fixture that actually lands exactly at the ceiling; fix an unreachable!
message's imprecise invariant claim (the real gating condition is
l4_spec.is_some() implies l4_loki.is_some(), not "iff frequency is
Some"); document loki_query_matrix's whole-second/bucket-alignment
precondition and verify it against l4_pair_spec, its only caller;
reorder loki_measure_frequency_pair's deadline-miss diagnostics to run
only when the completeness margin is actually missed, not on every
deadline-miss regardless of outcome; fix two fixture comments claiming
"~300s average spacing" that don't match their own timestamps (actually
~580s) and a comment attributing the L4 shortfall to ingest-side dedup
after that theory was directly disproven elsewhere in the same file.

Verified the remaining ~40 accumulated review threads (mostly a
recurring "shared 300s deadline" doc/code mismatch and the run_l4_pair
ordering claim, duplicated across many review rounds) against current
code: all already correct, superseded by earlier commits in this
investigation.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* fix(bench): rfc 0031 l4 — round-4 review triage on the margin comparator

Validate margin at function entry rather than after the phantom/overcount
checks, so an invalid margin always panics per the documented contract
instead of potentially returning a data-shaped mismatch first
(CodeRabbit). Fix the doc comment paragraph still describing the
superseded floor-based tolerance (Copilot). Reword the L4-skip
diagnostic and failure message to name both reasons l4_spec can be None
(picker bounds vs a backtick in the capture regex) and to make clear the
skip fails the dispatch rather than reading as benign (Copilot, two
sites).

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* fix(bench): rfc 0031 l4 — margin=1.0 strictness + panic-safe matrix poll

Two Copilot findings on the previous commit, both verified genuine:

The cardinality-1 exemption applied at any margin, so a caller passing
margin = 1.0 (exact completeness) would still accept Loki returning 0 of
1 for an n=1 key — the exemption now only applies to a genuinely
fractional margin, with a regression test covering both directions at
1.0. Bit-identical behavior at the harness's 0.90.

loki_query_matrix still used expect/assert internally, so a transient
transport error, 5xx, or torn body during the L4 poll — which runs LAST
in the same async block holding every other pair's already-collected
measurement — would panic and unwind all of it. Converted to
Result<L4Measured, String>; the poll loop now retries an Err until its
deadline exactly like an incomplete answer, then surfaces it as the
pair's failure. Extracted the below-margin shortfall diagnostics into
dump_l4_shortfall_diagnostics to stay under clippy's function-length
limit.

Neither change alters the measured semantics run #23 is currently
confirming (the comparator formula is untouched; at margin 0.90 the
exemption gating is unchanged).

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

* docs(bench): rfc 0031 l4 — document why the phantom check is cell-level

Copilot's latest pass proposed weakening phantom detection from
(bucket, group_key) cells to bare group_keys so a boundary-exact record
shifting into an empty adjacent bucket can't read as phantom. Declined:
a systematic bucket-decode error (every cell shifted one width — the
run #11 bug class) leaves every per-key total intact, so the cell-level
check is the only guard that catches it, while the false positive it
risks requires a nanosecond-exact bucket-boundary timestamp that no
real dispatch has ever produced. Documented the trade-off on
phantom_cells instead of changing behavior.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01WQY9wfrfRggqSpMLH8Xj3Y

---------

Co-authored-by: Claude Fable 5 <noreply@anthropic.com>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants