DataTree allows preparing a chain of commits which are applied in order. This capability is useful for hiding persistence and replication latency in clustered scenarios.

This amounts to handling multiple transaction commits, and sending state changes into persistence asynchronously.

Explore what options we have in interacting with persistence and what effects this has no message ordering. We definitely do not want to persist all events asynchronously, as some of these are mean state transitions which must happen before we accept any new messages.