I am not interested in "web3/crypto" solutions. Just pure theoretical papers that describe how one might go about solving this problem from first principles. The closest analogy would be Two Phase Commit for distributed databases.
If you can cite the papers or provide links that would be great.
https://www.hashicorp.com/resources/raft-consul-consensus-pr...
You might also look into the pBFT subject
Hyperledger Fabric, is a blockchain framework but not web3 / crypto that might be interesting too, if you are surveying widely
If you're lazy, you can just throw Zookeeper at the problem (this is what many Big Data systems like Spark and Kafka often use for synchronization and consensus):
- https://zookeeper.apache.org/
- https://zookeeper.apache.org/doc/current/zookeeperInternals....
None. Ever.¹ Proof: https://groups.csail.mit.edu/tds/papers/Lynch/jacm85.pdf
[1] Assuming that peers in your application can crash.
> THEOREM 2. There is a partially correct consensus protocol in which all nonfaulty processes always reach a decision, provided no processes die during its execution and a strict majority of the processes are alive initially.
This seems to be the silver lining from the paper for practitioners.
Indeed. Of course, the hard (impossible?) part is ensuring that no peers die.