@Brian, I am not an expert on OpenCoweb but I think Jack is talking about a purely distributed architecture. I do not believe that any text editing algorithm implemented in real world OT systems has yet to be able to satisfy the TP2 condition for convergence in a pure p2p network. Meaning OpenCoweb cannot be transformed work work with a serverless architecture.
Jack, that being said, this is mainly considerations around text maniuplation. Diagrams have different requirements for convergence depending on how the system is designed.
So with most methods the client and the server both do transformations. You might already know this, but instead of the server tracking the state of each client, each client tracks the server. Both do transformations, when operations come into the server, they are transformed against operations from other clients that have already occurred since that operation was received, then that operation is transmitted to other clients. The same thing occurs on the clients, transforming the new operaton which is in "server state space" against operations that have occured on the client since the last operation which was sent to the server. In this way the client is brought in sync with the server state.
Can you tell us more about your thesis?