Show HN: Reducing LLM Context Complexity from O(N^2) to O(k) (github.com)

[flagged]

those for loops over input clearly indicate a new proof for runtime complexity is there too

this is textbook slop