Go’s noalloc checker makes allocation assumptions explicit

The experimental noalloc tool checks Go functions marked as entry points and follows their calls to find heap allocations. It combines compiler escape information with analysis of dependencies and offers bounded containers for reusable memory. A passing check is conditional: exemptions and allowlists are trusted, and allocations on certain terminating error paths or first-use setup are allowed.

The Consensus Labs

Why it matters

Performance-sensitive Go code benefits from checks that reveal allocation regressions as the call tree changes.

More context

The MIT-licensed project requires Go 1.27 or later. Mark a small hot path with the root directive, inspect the allocation report and pair it with runtime allocation tests. The authors disclose AI-written implementation and documentation and describe the project as experimental.

Keep in mind

No verified release date was found. Unresolved calls can produce conservative findings, and compiler-output changes can affect analysis; pin the toolchain and review every exemption rather than treat the result as a universal zero-allocation proof.

Original read