Granularity Is a Parameter, Not a Virtue: Choosing Representation by Decision Error
Defaulting to the finest available representation (per-event, per-token, per-entity) is an unexamined assumption; representation granularity should be selected to minimize decision-relevant error against measurement noise, which sometimes means choosing the coarser model deliberately.
AngleUse the continuous-flow-versus-discrete-event argument from system dynamics as a counterexample to the fidelity-maximization instinct in agent observability and evaluation design.
Source video ↗Unit Checks Are an Architecture, Not a Lint Rule
Declaring a contract once and letting every downstream artifact inherit it structurally is a different class of guarantee than re-validating types at each hop, because the failure it prevents is silent integration drift rather than isolated malformed output.
AngleMap automatic unit control and outside-in build order onto typed tool contracts and interface-first scaffolding of agent workflow graphs, and quantify what changes when inheritance replaces boundary validation.
Source video ↗Your Agent's Memory Has the Spreadsheet Problem
The reason spreadsheets produce invisible blunders is not formula complexity but the absence of an enforced boundary between inputs and derived state; agent context and memory systems inherit that same blindness, so separating read and write paths is an architectural reliability decision, not a code-style preference.
AngleReframe memory correctness as a substrate property — argue that without enforced separation, cross-contamination defects surface late or never, and review discipline cannot compensate.
Source video ↗Granularity Crossover Bench
beyond-evalsFor a queuing/agent-throughput scenario, an aggregate continuous approximation yields lower end-to-end decision error than a per-event discrete trace below a definable arrival-rate threshold, where the discrete representation amplifies arrival-measurement noise.
Proof of conceptBuild paired continuous and discrete implementations of the same throughput scenario with seeded noisy arrival measurements, then evaluate both against ground truth across a sweep of arrival rates and queue depths.
MeasurementDecision error versus ground truth as a function of arrival rate and queue length; the arrival-rate value at which the error ordering inverts, with confidence intervals over seeds.
Source video ↗Inherited Contract Layer for Tool Orchestration
gatehouseA tool runtime where each unit/type is declared once and inherited structurally through the derivation graph blocks more integration defects at construction time, and leaks fewer to runtime, than per-call schema validation — but only until the unit vocabulary grows heterogeneous enough to force escape hatches.
Proof of conceptImplement a minimal orchestration runtime with declared contracts, structural inheritance, and an extensible type registry; run the same task suite against a per-call JSON-schema validation baseline.
MeasurementCount of mismatches caught at authoring/construction time versus runtime escape rate, plus blocked-construction events and escape-hatch usage per unit added as the registry scales.
Source video ↗Outside-In Under Boundary Uncertainty
newOutside-in authoring (fixed inputs first, derived nodes last) reduces rework and unit-mismatch errors versus unordered authoring when the exogenous/endogenous boundary is known at the start, but its advantage shrinks or inverts when that boundary is initially ambiguous.
Proof of conceptTwo authoring cohorts build the same workflow model with a deliberately ambiguous boundary; one uses an outside-in order, the other an unordered order preserving the same final artifact.
MeasurementRework cycles per model, unit/consistency mismatch count, and time-to-first-valid-simulation, compared across cohorts and across boundary-known versus boundary-ambiguous variants.
Source video ↗Read/Write Separation Audit for Agent Memory
gatehouseAgent memory substrates without an enforced read/write distinction exhibit a higher rate of stale-read and self-referential-write defects, and those defects are detected less often by standard evaluation than equivalent defects in substrates with enforced separation.
Proof of conceptImplement two memory substrates over identical retrieval logic — one conflating retrieved context with mutated state, one with a hard read/write boundary — then seed equivalent contamination faults in each.
MeasurementDefect incidence and defect-detection rate by existing eval suites for each substrate, with detection gap expressed as undetected defects per injected fault.
Source video ↗