Pedro Teixeira

There's nothing written down. Just dispersed personal knowledge. It would be great to start compiling the State of the Art in research and papers and decentralised platforms (and some platforms...

Here is a very old survey about ACLs in networked FS (probably useless, or perhaps some gems could be found here): https://repository.upenn.edu/cgi/viewcontent.cgi?article=1130&context=cis_reports

## Matrix.org: * identity service: https://github.com/matrix-org/matrix-doc/blob/master/specification/identity_service_api.rst * signatures: https://github.com/matrix-org/matrix-doc/blob/master/specification/appendices/signing_json.rst * end-to-end encryption: https://github.com/matrix-org/matrix-doc/blob/master/specification/modules/end_to_end_encryption.rst

## Tahoe LAFS: https://tahoe-lafs.org/trac/tahoe-lafs Somewhere in this doc capabilities are discussed: https://tahoe-lafs.org/trac/tahoe-lafs/browser/docs/architecture.rst

There is Automerge, by one of the authors of [the JSON-CRDT paper](https://arxiv.org/abs/1608.03960): https://github.com/automerge/automerge

BTW, who wants to take lead explaining the JSON CRDT? :) https://github.com/ipfs/research-CRDT/issues/35

@diasdavid @vmx This solution is more specific than IPLD graph-swap, since it's tailored for the multi-log data structure, but I think we need to introduce vector clocks to keep track...

Just watched @dominictarr 's talk about scalable secure scuttlebutt ([video here](https://www.youtube.com/watch?v=GN57bs1eAck&feature=youtu.be)) — thanks @olizilla! — and there are some ideas that have some parallel here:

## Eager and lazy connections: Turning the redundant connections from eager into lazy is a great idea, which I think we can apply here. I was worried of the redundancy...

## Optimizing vector clock transmission Instead of broadcasting the entire vector clock to every peer, send only the vector clock differences to each peer individually.