Evidence-First Claude Session MiningLesson 6/8
Bounded planning

Hard-Capped Window Planning

Cover every byte with complete records, bounded overlap, and no window above the cap.

U2 LIVE: PROVENSYNTHETIC EXAMPLE · /demo-claude/
Three overlapping windows under a sixty-byte cap with exclusive coverage0110W0 · [0,55) · 55 BW1 · [30,75) · 45 BW2 · [55,110) · 55 Boverlap
Three overlapping windows under a sixty-byte cap with exclusive coverage.
You will be able to
  • Reconstruct windows from record sizes and a hard cap.
  • Distinguish full coverage from exclusive coverage.
  • Explain why overlap may be smaller than requested.
1

Core model

Windows make large files addressable without pretending they fit in one context. The planner adds complete physical records until the next one would exceed the cap. A requested overlap is only an upper bound: it shrinks when needed so the next exclusive record can make progress.

Mental model: Pack whole books into boxes with a weight limit. You may repeat the last book as context, but you cannot tear a book or exceed the limit just to preserve the repetition.

For synthetic record sizes `[30,25,20,35]`, cap 60, overlap 1: full windows are records `[0,2)` bytes `[0,55)`, records `[1,3)` bytes `[30,75)`, and records `[2,4)` bytes `[55,110)`. Full spans overlap; exclusive ranges partition `[0,110)` with no gap. A single record above 60 fails the manifest.

2

Boundary table

QuestionObserved boundaryOwnerVerdict
W0records [0,2)bytes [0,55)55 B
W1records [1,3)bytes [30,75)45 B · overlap 25 B
W2records [2,4)bytes [55,110)55 B · overlap 20 B
Primary local sourcedocs/fable-session-mining/U2-MANIFEST-SCOPE.md
records = [30, 25, 20, 35]
maxWindowBytes = 60
overlapRecords = 1
// W0 [0,55) · W1 [30,75) · W2 [55,110)
Hard cap: Every full window byte count is at most the configured maximum.Hard cap
Every full window byte count is at most the configured maximum.
Full range: The entire window, including repeated overlap.Full range
The entire window, including repeated overlap.
Exclusive range: Bytes first introduced by this window.Exclusive range
Bytes first introduced by this window.
Forward progress: Every noninitial window introduces at least one new record.Forward progress
Every noninitial window introduces at least one new record.
3

Synthetic lab

Inspect a candidate plan under cap 60.

4

Retrieval and feedback

Predict before revealing

May the planner keep two overlap records if that leaves no room for the next new record?

No. Retain the largest suffix within the requested bound that still permits forward progress under the hard cap.

Retrieval cards

Retrieval cardsHard capActivate to flip
Hard capEvery full window byte count is at most the configured maximum.
Retrieval cardsFull rangeActivate to flip
Full rangeThe entire window, including repeated overlap.
Retrieval cardsExclusive rangeActivate to flip
Exclusive rangeBytes first introduced by this window.
Retrieval cardsForward progressActivate to flip
Forward progressEvery noninitial window introduces at least one new record.

Check your model

Which ranges must partition the file with no duplicates?

Full windows may overlap; exclusive ranges explain exactly-once coverage.
5

Evidence ledger

Contract · PROVENSCOPE + source
Implementation · PROVENfocused code + tests
Compiled boundary · PROVENU2 receipt recorded
Independent probe · PROVENU2 files/hashes/bytes match

Authority: docs/fable-session-mining/LOOP-LOG.md. Tests never upgrade a missing live receipt.