Local-first planning · 2026 · Solo — product framing, allocation engine, interaction design, verification, release
Retainer Runway
A deterministic scope boundary for consultants deciding what can be promised inside a fixed bank of hours.
The problem
A consultant can commit prioritized tasks whose estimates exceed a client's monthly bank, then discover the scope conflict late. Retainer Runway takes one hour allowance and ordered Task | hours lines, preserves priority order, and shows the contiguous in-scope set, overflow, remaining buffer, and first-item shortfall without transmitting or persisting the inputs.
Architecture
Key decisions
Preserve priority instead of optimizing
The allocator takes the contiguous ordered prefix that fits. It does not reshuffle tasks to maximize utilization because the input order is the operator's priority decision.
Keep the experiment local and bounded
Inputs are not persisted or transmitted. The build does not claim demand, conversion, pricing validation, or production project-management integration.
Make publication reproducible
Four allocation tests, lint, typecheck, production build, zero-vulnerability production audit, independent review, and a real production overflow path passed. GitHub SHA 995a34f20035580980ee65f2f20dbcc84769bdd7 is connected to successful Vercel deployment 5773839487.