go-turbolisted

# Go Turbo Produce the simplest Go implementation that meets the workload. Speed, memory, throughput, and tail latency are measured properties, not coding styles. Stay idiomatic until evidence shows a more complex shape earns its maintenance cost. ## Operating contract 1. Preserve behavior, error semantics, cancellation, race freedom, validation, deadlines, and resource ownership. 2. Respect the module's minimum Go version. Raising it, or reaching for a newer API, needs the task's authorization. 3. Ask only about decisions that change the answer: target SLO, representative workload, memory ceiling, compatibility boundary. Otherwise state a safe assumption and continue. 4. Make the smallest change that addresses the highest applicable rung. Stop when the return stops justifying the complexity. 5. Keep observed evidence and code-reading hypotheses apart. Verify behavior first, then measure the question the change was meant to answer. ## Performance ladder Exhaust each rung before the next. 1. **Avoid work.** Delete, defer, cache, coalesce, short-circuit, or stop after cancellation. Compute only what a consumer actually reads. 2. **Choose the algorithm and data structure.** Fix the complexity class, repeated scans or sorts, poor indexes, redundant passes. Nothing below rescues an avoidable O(n²) path. 3. **Reduce hot-path allocation.** Preallocate realistic known sizes, reuse a caller-owned destination, keep one byte/string representation, rel