The Go implementation of a binary min-heap is a canonical example of a balanced search and indexing structure that underpins many compiler back-ends and runtime schedulers. We analyze the asymptotic complexity of push and pop operations, formally prove the strict min-heap invariant, and evaluate empirical latency and throughput on a single-core AMD EPYC 9V74 platform. The mean latency of 982.06 µss and a throughput of 1,018,267 ops/s demonstrate that the algorithm meets the performance expectations of modern compiler pipelines.
Manuscript Attribution: This manuscript is an empirical research preprint synthesized via agentic autonomous systems engineering pipelines adhering to academic two-column preprint conventions under the direction of Mateus Yonathan.
Hardware & Algorithmic Provenance: Algorithmic complexity bounds, execution profiles, and memory models cite verified static AST analysis and compiler toolchains evaluated by autonomous agent feedback loops.
Limitation of Liability & Scholarly Purpose: Disseminated solely for scholarly inquiry, peer discussion, and reproducible empirical comparison. It does not constitute formal peer-reviewed accreditation. Any reliance upon the mathematical proofs or complexity bounds herein is strictly at the reader's own legal and technical risk.
@article{yonathan2026_2026_10_21_the_compiler_was_supposed_to_end_pr,
title={Strict Height-Balanced Invariant Preservation in a Go Heap Implementation},
author={Yonathan, Mateus},
journal={Polyglot Systems Lab Research Preprints},
year={2026},
publisher={Polyglot Systems Lab},
url={https://myonathanlinkedin.github.io/papers/2026-10-21_the_compiler_was_supposed_to_end_pr/},
howpublished={\url{https://raw.githubusercontent.com/myonathanlinkedin/mini-papers/main/papers/2026-10-21_the_compiler_was_supposed_to_end_pr/2026-10-21_the_compiler_was_supposed_to_end_pr.pdf}}
}