I like your graph-thingy on textile.io a lot as it looks cool and allows to “participate” by creating new dots. After playing around with it for a bit a realized that when you create too many dots then the structure becomes very complex, slowing down movement to a crawl and consuming most of your computers resources. I assume this is not by explicit coding but rather by the very nature of the inherent complexity. This is an almost perfect representation of the fundamental problem of complexity and participation that needs to be solved.
Thanks @ststefa! I wish I could say we did that on purpose… but you’re exactly right, its a function of the complexity of the ‘problem’. very fun observation, and very appropriate!
In furtherance of the concept of verified identity and earned reputation, these elements of establishing “trusted source” for accounts can also be applied to accounts generated by institutions rather than individuals. Imagine a news media institution creating an account to provide “news” posts. The peers that subscribe to a topic would see posts from institutions and individuals, and the peers would be able to upvote/downvote the “reputation” of an account, such as CNN or FoxNews. This could possibly have a beneficial effect on what any account posts to a given Topic/Channel.
about authentification and institution in France the gouvernement implement that https://franceconnect.gouv.fr/. this is a unique login for all gouvernement website. for create a account you need fill a form on this website and all information are verified by postman who’s at home to check the validity of the information.
Basically, a did document would represent an personal identity (personal here would refer to a human being), and reference supported services.
I suppose apps would update did documents on the behalf of the user, referencing the service they provide.
When a user A wants to interact with user B using this application, she would scan/paste the did:ipid: identifier of that user B, the app would fetch the document, and if it supports its service it would contain the information required for the two apps (the one each user is using) to interact together.
is this something you already considered? What are you thought on that?
I don’t have a solution (sorry) but just want to point out a problem with any reputation-based approaches: polarizing content gets the most reactions. On most social media the best metric is shares/retweets, which are rare, so they only happen when a user feels very strongly about something, i.e. because it’s polarizing. If 100 people think a post is decent, it’ll get 0 shares, but if 99 people think a post is low quality while 1 person gets riled up about it, it gets 1 share and way more attention. I worry the same thing would happen with your reputation system: FoxNews would get tons of reputation from their very polar audience, and AP will get none because plain unbiased facts are just not as invigorating.
Perhaps reputation can be adjusted by a combination of click-to-view-details events combined with like/share events. The quantity of followers of an account is another indicator of reputation.
That Mastodon link is really interesting, I didn’t think about how dangerous something as simple as “shares” could be. There are definitely some good thoughts there.
Also, on the topic of social networks, I wrote a short blog post recently and I wonder if you guys think it’s accurate in terms of the primary advantages of a decentralized social network. There’s been a lot of talk here about content creators and reputation, but I focused more on the Facebook use case, where it’s less about following content creators and more about regular user interaction.
You guys need a data model that is a) generic b) has URIs as native IDs c) has a zero-cost merge operation
Currently there is only one that fits the bill: RDF, plus Linked Data. It’s a directed graph model with mutiple serialization formats: https://www.w3.org/TR/rdf11-primer/
It would be great to benefit from a social media system between members, I am thinking it could be done through IPFS. Submitting there, in case a great tool is coming
