FIFO buffer bounded by bytes, not count (NFR3): pushing never fails, old data is evicted, and
every reader learns how much it missed. O(1) amortised push; reads are O(log n + page size).
Up to limit entries with seq > since that pass keep, oldest first. The cursor (nextSeq)
also advances over entries keep rejects, so paging with a filter never revisits them.
FIFO buffer bounded by bytes, not count (NFR3): pushing never fails, old data is evicted, and every reader learns how much it missed. O(1) amortised push; reads are O(log n + page size).