Exactly. I've found 6 minutes or so the sweet spot for upper bound with 5.6 Sol. And it sounds like the OPs query above requires scanning throughout a large p

Exactly. I've found 6 minutes or so the sweet spot for upper bound with 5.6 Sol. And it sounds like the OPs query above requires scanning throughout a large portion of the codebase, which will inherently consume a large number of input tokens. No locality to it.