And for a more intuitive explanation, this might help: https://braid.org/demo/interact#a-merge-type-defines-how-to-...
3,057 karma · joined May 5, 2012
https://invisible.college/@toomim
https://braid.org
And for a more intuitive explanation, this might help: https://braid.org/demo/interact#a-merge-type-defines-how-to-...
Depending on the order that those events arrive, and how ordering is disambiguated, it's possible that different peers could see User B's cursor at different positions.
I believe that the system you're describing is akin to an OT system, but where the "operations" to transform are the "cursor move" actions that occur simultaneously with insertions and deletions. Most OT systems, on the other hand, are trying to transform inserts and deletes against one another.
Edit: Yes, in fact this is equivalent to OT if you replace every OT insert or delete with a tuple [move cursor, ins/del] in your system.
...but my general belief is that UI patterns need to evolve as (1) specific UIs before they become (2) general patterns, and we simply don't have enough good solutions yet to make a pattern library out of them.
Each datum as both a data type and a merge type. The programmer just needs to specify these two types, and then the programming runtime can choose which synchronization algorithm to use.
In basketball, Dell Curry led to Seth Curry and Steph Curry, and the latter just broke the 3-point record. That's merit.
https://en.wikipedia.org/wiki/Conflict-free_replicated_data_...
Here's an example: https://peeryview.org/about
This was the first approach to measure the Economics of Attention, quantitatively. To do so, we define a new type of utility function, that can be measured with a new type of experiment that you can run via large-scale A/B tests, and lets you say things like "The new UI for Facebook is 6¢ per second worse than the old one!"
So did you read the paper and come up with a substantive scientific critique, or did you judge him on his social media activities and social opinions?
If your address is a function of a public key, then you're using "agent key addressing."
And not to beat a dead horse, but IPNS doesn't work very well. These days people tend to build their own naming systems using layers of IPLD hashes instead.
I think that's a fine road to go down for addressing data, but it's not content addressing.
It is heavily censored with wikipedia's left-leaning bias. Go read the talk page to see it in action.
If your computer's public key is xx73u2, then I can access it at https://xx73u2.onion/and/whatever/path/i/want, and tor handles all the encryption. From this perspective, anonymity comes as a bonus.
- ngrok
- ssh tunnel
- tor
- libp2p
?
I'd presume I want a network I can trust.
I doubt that the people who hate Steve Jobs are willing to make something called "The Steve Jobs Archive", anyway.
We should start considering CRDT/OT/VCS/Diffsync approaches to distributed systems as well. They present a very nice alternative approach: whereas PAXOS/RAFT implement a consistent "distributed state machine", a CRDT, OT, VCS, or Diffsync system implements consistent "distributed state", upon which one can build a machine as a function of the state.
This latter approach is actually simpler, IMO, because it encapsulates all the challenge of distributed consistency within a smaller subset of the problem — state synchronization. This makes it more generally re-usable. When you create a system, you can just use an off-the-shelf library & algorithm to synchronize your data over a network, and then write synchronous functions on top of that to represent the system you want, however you want, without having to understand PAXOS/RAFT.