> “replace line 2:f1, replace range 1:a3 through 3:0e, insert after 3:0e.”
replyNot sure what they're calculating, but this seems to me like it could be many times more efficient than 20%.
Yes, this looks like O(1) actions, where before, its likely that harnesses are ingesting and outputting huge portions of the source files for each step, and the local uses of str_replace() are themselves O(N) on the users computer. The excess reads and writes from the LLM are O(N^2).
replyThe benchmarks seem to indicate 25-50% reduction in tokens. I'm not sure how that works in real world usage though.
reply