perf(chain): normalized detail coverage table and sweep floors #14

Merged
KofTwentyTwo merged 1 commits from feature/chain-coverage-perf into develop 2026-10-15 12:42:39 +00:00
1 Commits
Author SHA1 Message Date
james.maesandClaude Opus 5.5 18ae80740b perf(chain): normalized detail coverage table and sweep floors
The chain writer re-read the whole late-detail lookback every 30 s and
probed the GIN array index once per detail (18.4 s, 1.78M buffer hits per
tick in production), and the coverage trigger's EXISTS overlap check ran as
a cached generic plan that sequentially scanned worm_audit_chain for every
inserted link.

- worm-audit:13: worm_audit_chain_detail (detail_id PK, chain_id), one
  append-only row per covered detail, written by the chain trigger in the
  same statement as the link and backfilled under the chain advisory lock.
  WORM guards and grants like the other tables; no foreign keys.
- The trigger inserts coverage rows and lets the primary key reject a
  detail covered twice. The purge deletes coverage before its links.
- lateDetails probes the coverage primary key; both sweeps read only ids
  above per-JVM sweep floors, with a full sweep after restart and hourly.
- Verification aggregates the chain's own detail lists once and breaks if
  the coverage table disagrees. Link hash inputs are unchanged.
- Memory and H2 backends: the writer records coverage rows itself.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
2026-10-15 07:40:33 -05:00