When I first got interested in the SafeNET I did a lot of reading of various bits of documentation and source code. As I learned more there two feasibility questions that I could not quite wrap my head around. The first is the economics of the pay-for-put model (which I don’t want to talk about in this thread), but the second was the SafeNET’s decision when it comes to the CAP theorem. The theorem basically holds that in the face of a partition, you can choose for a network application to be either consistent or available. (The theorem is often presented as a choice between three options, but you can never choose for your network not to experience partitions). From an app developer’s point of view, it would be nice to know precisely what consistency/availability guarantees, if any, the SafeNET provides.
I would not be surprised if there was an RFC somewhere that talks about this in detail, but I have not been able to find it.
If there is a clear answer, and other people think this is as important as I do, I think it would be nice to try to make an effort to make the answer more clearly apparent for new developers. The SafeNET functions like a database for app developers and the approach to the CAP theorem is an important question to ask when looking into a new distributed database technology.