git ssb

%BB/W9y4esufgf/9nnZnSjPs9UfdRN9hyKDMUOXtnyQE=.sha256

{
  "previous": "%R+0+4qo59t4oB5nZdlDev2V6ZSjQ2Q3lonc8i1KWXPQ=.sha256",
  "author": "@uikkwUQU4dcd/ZrHU7JstnkTgncxQB2A8PDLHV9wDAs=.ed25519",
  "sequence": 604,
  "timestamp": 1457585054414,
  "hash": "sha256",
  "content": {
    "type": "post",
    "text": ">you cant have consensus in a asynchronous system (which SSB is) I'm skeptical of any consistency solution that doesnt have a good paper behind it\n\n[Signature-Free Asynchronous Binary Byzantine Consensus](https://hal.archives-ouvertes.fr/hal-01176110/file/JACM.pdf) there are servarl more recent variations on this. Andrew Miller has prototype implementation of the above. The catch here is that it  relies on a shared random number (pretty intersting how it is used to force convergence though). ",
    "root": "%tvrfymWXkQZwccy4TGYrRYPSJDcpU7iTJgYK0fWHuao=.sha256",
    "branch": "%H8edfbnHBMas36+clOKmmfLMwNWylUbmhGjfoyOixIM=.sha256",
    "channel": "mad-science"
  },
  "signature": "+om2vJQEksK8tO5dsXGoxZCfk/JZyi3lrF71brKtsbK+oQr08RC7YjUnkV16lA/5szNopgHH47bxhByJruRmCA==.sig.ed25519"
}