From the footnote: > In CS terms, expanding a poorly-specced and unmaintainable Factorio base is O(log(n)) while expanding a perfectly specced one is O(n), but

From the footnote: > In CS terms, expanding a poorly-specced and unmaintainable Factorio base is O(log(n)) while expanding a perfectly specced one is O(n), but the coefficient on the first is massively higher. Shouldn't this be the other way around? Speccing out requires higher upfront effort, meaning a higher coefficient, but ultimately results in better long term results in overall required effort, for an O(log(n)) graph.