You are reviewing a proposed RememberStack design BEFORE any runtime implementation. The owner explicitly requires your Claude Opus approval before implementation, prioritizes reliability over speed, and wants general-purpose changes rather than LoCoMo-specific score hacks.

Work read-only in /Users/jpuc/code/moje/remember-stack-retrieval-analysis-20261112. Do not edit files, run model/provider calls, probe live hosts/databases, open private environment files, or create agents. Read AGENTS.md/CLAUDE.md and relevant design instructions. Inspect the actual source; do not rely just on the proposal's characterization.

Review target (commit 32b2a5d2d):
- plan/proposals/shared_retrieval_eligibility.md (the concrete design)
- plan/analysis/retrieval_filtering_reliability_20261112.md and readable measurements.json (evidence)
- D142/D149 and relevant current designs
- src/rememberstack/surfaces/query_engine.py
- src/rememberstack/adapters/postgres_p1.py and p1_ranked.py
- relevant entity/fact authority migrations, query-space definitions and tests

The design keeps current scoped exact ranking and broad index continuation. It fixes repeated coverage and candidate provenance, and factors fact source membership/presentation from endpoint visibility so bounded native reads can share endpoint eligibility. No runtime code is edited yet. The active benchmark's incomplete ingestion is separately preserved; do not change it.

Please check carefully:
1. Complete preservation of deletion/version/coordinate visibility, old-version-only entity provenance, document-entity bridges, merges/latest decisions, current/history identity/belief semantics, D140 evidence windows, D54 counts and contradiction-only facts.
2. Whether fact factoring is precisely specified and implementable without a second fact-truth query, permission expansion, duplicated count authority or forced full-project materialization. Recommend a smaller equivalent design if it is materially safer; identify any concrete contract gaps that would block implementation.
3. Physical work and memory at millions of rows; candidate/provenance boundaries, repeated entity work, and whether SQL materialization really ensures the stated reuse.
4. SQL snapshot/deadline/cancellation, ACL and query-space manifest/saved-query integration.
5. No paid ingestion/reuse-key changes (D56), hidden fallback, legacy runtime path, new reranker or benchmark-specific logic.
6. Whether equality, actual-plan, concurrency and full-native-operation gates are adequate and feasible. Distinguish strict correctness requirements from nice-to-have throughput benchmarks.

Return a clear APPROVED or CHANGES REQUIRED verdict. If changes are required, number blocking findings with precise document/source locations and concrete required amendments; separate nonblocking suggestions. Do not approve with unresolved blocking caveats. If you approve, briefly explain why the proposed implementation boundary is safe. Do not implement anything.
