The big selling point of `soanm` is that you don't need to have anything extra installed on a typical distribution (not even ssh!) and you don't need to know any extra configuration language, or how to use a special library, or anything beyond shell scripting. Of course, you also trade a lot of functionality away: The programs you write aren't declarative, and so on. But personally I don't care about that when provisioning a new dev machine. I'd much rather just run some quick scripts.
Entropy of a single password isn't actually a well-defined concept; entropy is always about a distribution. "Entropy calculators" that look at your password and tell you "its entropy" are making assumptions about how you chose the password.
We care about the distribution from which you drew the password, because that lets us analyze how difficult it would be for an attacker who knew your password selection process to brute-force the password. Just knowing the password itself isn't enough information to determine that (though of course you can judge how hard it would be for an attacker once you know their brute forcing strategy).
I mostly agree, but I do find myself choosing a new FDE and login passphrases about once a year, and I wish that I could choose these using something like Diceware, but memorable enough that I wouldn't need to write them down at all. Thinking about how I might do that is what ultimately led to this post.
This is a fair question; I've been thinking about "weird" password choice strategies recently, for which it can matter. For example, if you want your password to be an English sentence, choosing sentences based on random parse trees will produce duplicated sentences with ambiguous parses.
I hadn't looked at yjs; I'll check it out! [edit: It looks to me like yjs is much more flexible than my design here, but doesn't include an ability to move ranges of lists to different locations]
Darn, and just after I'd implemented it myself in terrible beginner Rust! I might get started reimplementing it using your tool :)
If anyone is interested, I've been trying to think about the problem of moving ranges in a list-structured CRDT for a couple of weeks now for a side project, and I've got a candidate that seems to satisfy the most obvious constraints. I'd be really interested in any feedback / holes you can poke in my solution!
Sure - I still think the title is misleading. "Was always a scam" implies that everyone in the sharing economy has been lying for decades in order to make money. I don't see any evidence presented in the article that supports that implication.
And when looking at it through a reasonable lens as you do in your comment, I also don't understand the urge to treat it as though "sharing economy" companies are somehow evil or deceptive. They're just responding to market conditions in a way that (at least in the short term) produces value for both drivers and riders. There are other arguments you can make about whether this is bad in the long term due to e.g. dynamics around regulation, but that's an argument about how things will play out in the future, not about past or current bad faith on the part of Uber or AirBnb.
The title seems totally unsupported by the article to me. A less misleading one might be "The 'sharing economy' has evolved into a collection of large, unregulated, rental businesses"
This is a critical response to https://news.ycombinator.com/item?id=18609375 ; in the comments is a response by Jamie Farnes, the author of the paper, and a rebuttal by the blog's author.