all-read-paths-are-deterministic-and-resilient
OUT derived (depth 3)
Every read-path operation produces deterministic output resilient to environmental variation: search handles missing FTS5 indexes via self-healing derived indexes and substring fallback, staleness checking produces sorted uniformly-structured CI-pipeline-ready results, and compact generates predictable bounded output from a pure function with fixed priority ordering.
Summary
All the read operations in the system — searching, checking for stale data, and compacting — are designed to give consistent, predictable results no matter what state the environment is in. This matters because it means these operations can be trusted in automated pipelines and won't produce surprising output if, say, a search index is missing or the database is in an unexpected state, but the claim is currently retracted because at least one of its supporting observations no longer holds.
Justifications
SL — Three independent read-path operations all achieve deterministic resilient output, establishing a system-wide read-path quality property
Antecedents (all must be IN):
- search-is-resilient-across-index-states — Search operates correctly regardless of FTS5 index availability: the index is derived (rebuilt from scratch on every save) so stale indexes are self-healing, and search falls back to substring matching when FTS tables don't exist or error
- staleness-output-is-ci-pipeline-ready — Staleness checking produces deterministic, uniformly-structured, machine-parseable output with conservative non-mutating semantics and nonzero exit codes, making it directly consumable by automated CI pipelines without wrapper scripts
- compact-is-predictable-bounded-distillation — The compact module is a fully predictable information distillation: a pure function with deterministic priority ordering that reliably constrains output within token budgets, self-reports resource usage, and structurally important nodes are prioritized through dependent-count sorting
Dependents
These beliefs depend on this one:
- all-information-retrieval-is-fault-tolerant — Every information retrieval path — structured reads (FTS search with index self-healing, staleness checking with deterministic output, compact with pure bounded distillation) and LLM-synthesized queries (ask with bounded tool loops and raw search fallback) — degrades gracefully rather than failing, ensuring the system always returns useful results
- all-output-is-deterministic-authorized-and-resilient — All information leaving the belief network is simultaneously deterministic (pure functions with fixed priority ordering), authorized (access-tag subset-gated), budget-constrained (token limits enforced), and resilient to environmental variation (self-healing indexes, exception-free operation) — every output path enforces all four properties.
- all-outputs-are-normalized-deterministic-and-resilient — All system output pathways — structured inspection results (uniform fail-safe schemas for review and staleness), read-path queries (deterministic ordering with multi-tier graceful degradation), and compact summaries (pure function with budget bounds) — produce normalized, deterministic, and environmentally-resilient output regardless of upstream conditions.
- query-degradation-is-deterministic-across-all-access-paths — All information access paths degrade gracefully while maintaining deterministic output: interactive queries cascade through tiered modes (LLM synthesis → bounded tool loop → raw FTS5 search), structured reads self-heal missing indexes via derived FTS5 reconstruction, and all fallback paths produce deterministic sorted output.