MUD dilemma I'm facing: how to get freshly processed state without making an on-chain tx.

An abstraction provided by the MUD sdk to simulate mutating calls generically and reindex + return the resulting table state would solve this, but seems fairly high complexity unfortunately.

This is a problem in general with EVM apps and frontends right? Not just a MUD thing.

Definitely think there’s a tooling gap we can help close here, but just wanna confirm that this isn’t a MUD specific problem.

yeah wherever we've been using design patterns that require state anticipation, we've just been reimplementing it on the frontend and it's definitely been a lift.

if there were an easy tool for simulating this it would also help out external people implementing bots/clients too i suppose.